$σ$-Maximal Ancestral Graphs
Fuente:
arXiv
Saved in:
| Main Authors: | Yao, Binghua, Mooij, Joris M. |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Aligning Multiple Inhomogeneous Random Graphs: Fundamental Limits of Exact Recovery
by: Ameen, Taha, et al.
Published: (2024)
by: Ameen, Taha, et al.
Published: (2024)
A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates
by: Weiss, Eyal, et al.
Published: (2022)
by: Weiss, Eyal, et al.
Published: (2022)
Computing and Learning on Combinatorial Data
by: Zhang, Simon
Published: (2025)
by: Zhang, Simon
Published: (2025)
Tightest Admissible Shortest Path
by: Weiss, Eyal, et al.
Published: (2023)
by: Weiss, Eyal, et al.
Published: (2023)
Query Complexity of Tournament Solutions
by: Maiti, Arnab, et al.
Published: (2016)
by: Maiti, Arnab, et al.
Published: (2016)
On the Parameterized Intractability of Determinant Maximization
by: Ohsaka, Naoto
Published: (2022)
by: Ohsaka, Naoto
Published: (2022)
Are Graph Neural Networks Optimal Approximation Algorithms?
by: Yau, Morris, et al.
Published: (2023)
by: Yau, Morris, et al.
Published: (2023)
Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space
by: Brosse, Caroline, et al.
Published: (2024)
by: Brosse, Caroline, et al.
Published: (2024)
Learning to Prune Instances of Steiner Tree Problem in Graphs
by: Zhang, Jiwei, et al.
Published: (2022)
by: Zhang, Jiwei, et al.
Published: (2022)
Maximizing a Submodular Function with Bounded Curvature under an Unknown Knapsack Constraint
by: Klimm, Max, et al.
Published: (2022)
by: Klimm, Max, et al.
Published: (2022)
Entropy Equivalence Testing
by: Canonne, Clément L., et al.
Published: (2026)
by: Canonne, Clément L., et al.
Published: (2026)
Graph Visualization for Blockchain Data
by: Dietl, Marcell, et al.
Published: (2024)
by: Dietl, Marcell, et al.
Published: (2024)
Online Graph Coloring for $k$-Colorable Graphs
by: Kawarabayashi, Ken-ichi, et al.
Published: (2025)
by: Kawarabayashi, Ken-ichi, 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)
Breaking the Metric Voting Distortion Barrier
by: Charikar, Moses, et al.
Published: (2023)
by: Charikar, Moses, et al.
Published: (2023)
Stability in Graphs with Matroid Constraints
by: Fomin, Fedor V., et al.
Published: (2024)
by: Fomin, Fedor V., et al.
Published: (2024)
Temporal Graph Realization With Bounded Stretch
by: Mertzios, George B., et al.
Published: (2025)
by: Mertzios, George B., et al.
Published: (2025)
Triangle Detection in H-Free Graphs
by: Abboud, Amir, et al.
Published: (2025)
by: Abboud, Amir, et al.
Published: (2025)
Distance-Preserving Graph Compression Techniques
by: Madani, Amirali, et al.
Published: (2023)
by: Madani, Amirali, et al.
Published: (2023)
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)
FO and MSO Model Checking on Temporal Graphs
by: Döring, Michelle, et al.
Published: (2026)
by: Döring, Michelle, et al.
Published: (2026)
Tight Paths and Tight Pairs in Weighted Directed Graphs
by: Balcázar, José Luis
Published: (2025)
by: Balcázar, José Luis
Published: (2025)
Exponential Time Approximation for Coloring 3-Colorable Graphs
by: Guruswami, Venkatesan, et al.
Published: (2024)
by: Guruswami, Venkatesan, et al.
Published: (2024)
Robust Graph Isomorphism, Quadratic Assignment and VC Dimension
by: Dahan, Anatole, et al.
Published: (2026)
by: Dahan, Anatole, et al.
Published: (2026)
The Complexity of Temporal Vertex Cover in Small-Degree Graphs
by: Hamm, Thekla, et al.
Published: (2022)
by: Hamm, Thekla, et al.
Published: (2022)
Approximating Maximum Edge 2-Coloring by Normalizing Graphs
by: Mömke, Tobias, et al.
Published: (2024)
by: Mömke, Tobias, et al.
Published: (2024)
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)
SAT Encoding of Partial Ordering Models for Graph Coloring Problems
by: Faber, Daniel, et al.
Published: (2024)
by: Faber, Daniel, et al.
Published: (2024)
Monotonicity Testing of High-Dimensional Distributions with Subcube Conditioning
by: Chakrabarty, Deeparnab, et al.
Published: (2025)
by: Chakrabarty, Deeparnab, et al.
Published: (2025)
Graph Coloring Below Guarantees via Co-Triangle Packing
by: Akmal, Shyan, et al.
Published: (2025)
by: Akmal, Shyan, et al.
Published: (2025)
(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)
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)
Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs
by: Wang, Chen, et al.
Published: (2024)
by: Wang, Chen, et al.
Published: (2024)
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)
A Faster Isomorphism Test for Graphs of Small Degree
by: Grohe, Martin, et al.
Published: (2018)
by: Grohe, Martin, et al.
Published: (2018)
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)
Similar Items
-
Aligning Multiple Inhomogeneous Random Graphs: Fundamental Limits of Exact Recovery
by: Ameen, Taha, et al.
Published: (2024) -
A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates
by: Weiss, Eyal, et al.
Published: (2022) -
Computing and Learning on Combinatorial Data
by: Zhang, Simon
Published: (2025) -
Tightest Admissible Shortest Path
by: Weiss, Eyal, et al.
Published: (2023) -
Query Complexity of Tournament Solutions
by: Maiti, Arnab, et al.
Published: (2016)