Image de couverture de livre

Connectivity-Preserving Minimum Separator in AT-free Graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Kenig, Batya
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems
par: Kenig, Batya
Publié: (2025)

Enumeration of Minimal Hitting Sets Parameterized by Treewidth
par: Kenig, Batya, et autres
Publié: (2024)

A Fast Approximation Algorithm for the Minimum Balanced Vertex Separator in a Graph
par: Kolmogorov, Vladimir, et autres
Publié: (2026)

Minimum Temporal Spanners in Happy Graphs
par: Casteigts, Arnaud, et autres
Publié: (2026)

Approximation Algorithms for Connected Maximum Coverage, Minimum Connected Set Cover, and Node-Weighted Group Steiner Tree
par: D'Angelo, Gianlorenzo, et autres
Publié: (2025)

Decentralized Privacy Preservation for Critical Connections in Graphs
par: Li, Conggai, et autres
Publié: (2024)

New Separations and Reductions for Directed Preservers and Hopsets
par: Hoppenworth, Gary, et autres
Publié: (2024)

Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs
par: Ito, Takehiro, et autres
Publié: (2025)

Near-Optimal Fault-Tolerant Strong Connectivity Preservers
par: Hoppenworth, Gary, et autres
Publié: (2025)

Maximum-Flow and Minimum-Cut Sensitivity Oracles for Directed Graphs
par: Ahi, Mridul, et autres
Publié: (2025)

Local Computation Algorithms for (Minimum) Spanning Trees on Expander Graphs
par: Peng, Pan, et autres
Publié: (2026)

Deterministic Near-Linear Time Minimum Cut in Weighted Graphs
par: Henzinger, Monika, et autres
Publié: (2024)

Temporal Graph Reconfiguration for Always-Connected Graphs
par: Sievers, Paul, et autres
Publié: (2025)

New Algorithms for Incremental Minimum Spanning Trees and Temporal Graph Applications
par: Ding, Xiangyun, et autres
Publié: (2025)

Connectivity Labeling in Faulty Colored Graphs
par: Petruschka, Asaf, et autres
Publié: (2024)

Exploration of Always $S$-Connected Temporal Graphs
par: Adamson, Duncan, et autres
Publié: (2026)

Distributed Approximate Maximum Matching and Minimum Vertex Cover via Generalized Graph Decomposition
par: Davies-Peck, Peter
Publié: (2026)

Graph Reconstruction with a Connected Components Oracle
par: Harviainen, Juha, et autres
Publié: (2025)

Graph Traversal via Connected Mobile Agents
par: Jana, Saswata, et autres
Publié: (2025)

Approximation Schemes for Planar Graph Connectivity Problems
par: Neuwohner, Meike, et autres
Publié: (2025)

Separator Theorem for Minor-Free Graphs in Linear Time
par: Bonnet, Édouard, et autres
Publié: (2025)

All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed Graphs
par: Anand, Aditya, et autres
Publié: (2025)

Global vs. s-t Vertex Connectivity Beyond Sequential: Almost-Perfect Reductions & Near-Optimal Separations
par: Blikstad, Joakim, et autres
Publié: (2025)

Parallel Algorithm For Finding The Minimum s/t Cut in a Structured 3-Dimensional Proper Order Graph
par: Chandramouli, Shridharan
Publié: (2026)

Realization of Temporally Connected Graphs Based on Degree Sequences
par: Casteigts, Arnaud, et autres
Publié: (2025)

The Connected k-Vertex One-Center Problem on Graphs
par: Zhang, Jingru
Publié: (2024)

Creating Robust and Fair Graph Structures for Connectivity and Clustering
par: Chatterjee, Kushagra
Publié: (2026)

A Separator for Minor-Free Graphs Beyond the Flow Barrier
par: Le, Hung
Publié: (2026)

Directed and Undirected Vertex Connectivity Problems are Equivalent for Dense Graphs
par: Fischer, Olivier, et autres
Publié: (2025)

Cut-Preserving Vertex Sparsifiers for Planar and Quasi-bipartite Graphs
par: Chen, Yu, et autres
Publié: (2024)

Separations between Oblivious and Adaptive Adversaries for Natural Dynamic Graph Problems
par: Bernstein, Aaron, et autres
Publié: (2025)

Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number
par: Casel, Katrin, et autres
Publié: (2019)

Minimum $s$--$t$ Cuts with Fewer Cut Queries
par: Jiang, Yonggang, et autres
Publié: (2025)

Exact Optimization for Minimum Dominating Sets
par: Zhu, Enqiang, et autres
Publié: (2025)

Faster Global Minimum Cut with Predictions
par: Moseley, Benjamin, et autres
Publié: (2025)

Faster Pseudo-Deterministic Minimum Cut
par: Kenneth-Mordoch, Yotam
Publié: (2026)

Thin Trees for Near Minimum Cuts
par: Klein, Nathan, et autres
Publié: (2026)

Maximizing the Minimum Eigenvalue in Constant Dimension
par: Brown, Adam, et autres
Publié: (2024)

Width Parameters for Minimum Flow Decomposition
par: Grigorjew, Andreas, et autres
Publié: (2024)

Planar Length-Constrained Minimum Spanning Trees
par: Hershkowitz, D Ellis, et autres
Publié: (2025)