FO and MSO Model Checking on Temporal Graphs
Fuente:
arXiv
Saved in:
| Main Authors: | Döring, Michelle, Enright, Jessica, Larios-Jones, Laura, Skretas, George |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Parameterised algorithms for temporally satisfying reconfiguration problems
by: Davot, Tom, et al.
Published: (2025)
by: Davot, Tom, et al.
Published: (2025)
Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs
by: Deligkas, Argyrios, et al.
Published: (2025)
by: Deligkas, Argyrios, et al.
Published: (2025)
Temporal Graph Realization With Bounded Stretch
by: Mertzios, George B., et al.
Published: (2025)
by: Mertzios, George B., et al.
Published: (2025)
How to Reduce Temporal Cliques to Find Sparse Spanners
by: Angrick, Sebastian, et al.
Published: (2024)
by: Angrick, Sebastian, et al.
Published: (2024)
Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve
by: Davot, Tom, et al.
Published: (2024)
by: Davot, Tom, et al.
Published: (2024)
The Complexity of Temporal Vertex Cover in Small-Degree Graphs
by: Hamm, Thekla, et al.
Published: (2022)
by: Hamm, Thekla, et al.
Published: (2022)
$O(n +f(k))$: Truly Linear FPT
by: Bumpus, Benjamin Merlin, et al.
Published: (2026)
by: Bumpus, Benjamin Merlin, et al.
Published: (2026)
The Complexity of Transitively Orienting Temporal Graphs
by: Mertzios, George B., et al.
Published: (2021)
by: Mertzios, George B., et al.
Published: (2021)
Extending Ghouila-Houri's Characterization of Comparability Graphs to Temporal Graphs
by: Charbit, Pierre, et al.
Published: (2025)
by: Charbit, Pierre, et al.
Published: (2025)
Algorithmic Aspects of Temporal Betweenness
by: Buß, Sebastian, et al.
Published: (2020)
by: Buß, Sebastian, et al.
Published: (2020)
Online Graph Coloring for $k$-Colorable Graphs
by: Kawarabayashi, Ken-ichi, et al.
Published: (2025)
by: Kawarabayashi, Ken-ichi, et al.
Published: (2025)
Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs
by: Holtgrefe, Niels, et al.
Published: (2024)
by: Holtgrefe, Niels, et al.
Published: (2024)
Stability in Graphs with Matroid Constraints
by: Fomin, Fedor V., et al.
Published: (2024)
by: Fomin, Fedor V., et al.
Published: (2024)
Graph Visualization for Blockchain Data
by: Dietl, Marcell, et al.
Published: (2024)
by: Dietl, Marcell, et al.
Published: (2024)
Distance-Preserving Graph Compression Techniques
by: Madani, Amirali, et al.
Published: (2023)
by: Madani, Amirali, et al.
Published: (2023)
Triangle Detection in H-Free Graphs
by: Abboud, Amir, et al.
Published: (2025)
by: Abboud, Amir, et al.
Published: (2025)
Online Graph Balancing and the Power of Two Choices
by: Bansal, Nikhil, et al.
Published: (2026)
by: Bansal, Nikhil, et al.
Published: (2026)
Optimal Enumeration of Eulerian Trails in Directed Graphs
by: Bals, Ben, et al.
Published: (2026)
by: Bals, Ben, et al.
Published: (2026)
Optimal Padded Decomposition For Bounded Treewidth Graphs
by: Filtser, Arnold, et al.
Published: (2024)
by: Filtser, Arnold, et al.
Published: (2024)
Spirals and Beyond: Competitive Plane Search with Multi-Speed Agents
by: Georgiou, Konstantinos, et al.
Published: (2025)
by: Georgiou, Konstantinos, et al.
Published: (2025)
Robust Graph Isomorphism, Quadratic Assignment and VC Dimension
by: Dahan, Anatole, et al.
Published: (2026)
by: Dahan, Anatole, et al.
Published: (2026)
Exponential Time Approximation for Coloring 3-Colorable Graphs
by: Guruswami, Venkatesan, et al.
Published: (2024)
by: Guruswami, Venkatesan, et al.
Published: (2024)
Approximating Maximum Edge 2-Coloring by Normalizing Graphs
by: Mömke, Tobias, et al.
Published: (2024)
by: Mömke, Tobias, et al.
Published: (2024)
Tight Paths and Tight Pairs in Weighted Directed Graphs
by: Balcázar, José Luis
Published: (2025)
by: Balcázar, José Luis
Published: (2025)
Subgraph Counting in Subquadratic Time for Bounded Degeneracy Graphs
by: Paul-Pena, Daniel, et al.
Published: (2024)
by: Paul-Pena, Daniel, et al.
Published: (2024)
Algorithmic Results for Weak Roman Domination Problem in Graphs
by: Paul, Kaustav, et al.
Published: (2024)
by: Paul, Kaustav, et al.
Published: (2024)
Efficient Algorithms for Interdicting Facilities in Trees and Bounded Treewidth Graphs
by: Abbasi, Ali, et al.
Published: (2026)
by: Abbasi, Ali, et al.
Published: (2026)
Pattern-Sparse Tree Decompositions in $H$-Minor-Free Graphs
by: Marx, Dániel, et al.
Published: (2026)
by: Marx, Dániel, et al.
Published: (2026)
Graph Coloring Below Guarantees via Co-Triangle Packing
by: Akmal, Shyan, et al.
Published: (2025)
by: Akmal, Shyan, et al.
Published: (2025)
Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs
by: Wang, Chen, et al.
Published: (2024)
by: Wang, Chen, et al.
Published: (2024)
(Almost-)Optimal FPT Algorithm and Kernel for $T$-Cycle on Planar Graphs
by: Gahlawat, Harmender, et al.
Published: (2025)
by: Gahlawat, Harmender, et al.
Published: (2025)
A Finer View of the Parameterized Landscape of Labeled Graph Contractions
by: Mathur, Yashaswini, et al.
Published: (2025)
by: Mathur, Yashaswini, et al.
Published: (2025)
A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in Bounded Degeneracy Graphs
by: Paul-Pena, Daniel, et al.
Published: (2022)
by: Paul-Pena, Daniel, et al.
Published: (2022)
Fanciful Figurines flip Free Flood-It -- Polynomial-Time Miniature Painting on Co-gem-free Graphs
by: Rosenke, Christian, et al.
Published: (2026)
by: Rosenke, Christian, et al.
Published: (2026)
Maximum Biclique for Star 1,2,3 -free and Bounded Bimodularwidth Twin-free Bipartite Graphs $\star$
by: de Montgolfier, Fabien, et al.
Published: (2025)
by: de Montgolfier, Fabien, et al.
Published: (2025)
Unsplittable Cost Flows from Unweighted Error-Bounded Variants
by: Swamy, Chaitanya, et al.
Published: (2025)
by: Swamy, Chaitanya, et al.
Published: (2025)
EPTAS for Hard Graph Cut Problems for Dense Graphs
by: Deguchi, Kaisei, et al.
Published: (2026)
by: Deguchi, Kaisei, et al.
Published: (2026)
Matching Algorithms in the Sparse Stochastic Block Model
by: Brandenberger, Anna, et al.
Published: (2024)
by: Brandenberger, Anna, et al.
Published: (2024)
Cuts in Graphs with Matroid Constraints
by: Banik, Aritra, et al.
Published: (2024)
by: Banik, Aritra, et al.
Published: (2024)
$α_i$-Metric Graphs: Hyperbolicity
by: Dragan, Feodor F., et al.
Published: (2024)
by: Dragan, Feodor F., et al.
Published: (2024)
Similar Items
-
Parameterised algorithms for temporally satisfying reconfiguration problems
by: Davot, Tom, et al.
Published: (2025) -
Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs
by: Deligkas, Argyrios, et al.
Published: (2025) -
Temporal Graph Realization With Bounded Stretch
by: Mertzios, George B., et al.
Published: (2025) -
How to Reduce Temporal Cliques to Find Sparse Spanners
by: Angrick, Sebastian, et al.
Published: (2024) -
Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve
by: Davot, Tom, et al.
Published: (2024)