Image de couverture de livre

On the Confluence of Directed Graph Reductions Preserving Feedback Vertex Set Minimality

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Abdenbi, Moussa, Massé, Alexandre Blondin, Goupil, Alain, Marcotte, Odile
Format:	Preprint
Publié:	2024
Sujets:	Discrete Mathematics G.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The Leaf Function of Penrose P2 Graphs
par: Porrier, Carole, et autres
Publié: (2023)

On the Parameterized Tractability of Packing Vertex-Disjoint A-Paths with Length Constraints
par: Bandopadhyay, Susobhan, et autres
Publié: (2026)

An Upper Bound for the Double Domination Number in Maximal Outerplanar Graphs
par: Araki, Toru
Publié: (2026)

A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus
par: Sun, Hao
Publié: (2023)

Improving the Crossing Lemma by Characterizing Dense 2-Planar and 3-Planar Graphs
par: Büngener, Aaron, et autres
Publié: (2024)

Improved Dynamics for the Maximum Common Subgraph Problem
par: Guidobene, Davide, et autres
Publié: (2024)

Temporal Connectivity Augmentation
par: Bellitto, T., et autres
Publié: (2025)

Binary Stretch Embedding of Weighted Graphs
par: Ebrahimi, Javad B., et autres
Publié: (2024)

New Results on Edge-coloring and Total-coloring of Split Graphs
par: Couto, Fernanda, et autres
Publié: (2023)

Singular Values Versus Expansion in Directed and Undirected Graphs
par: Ruotolo, Jake, et autres
Publié: (2025)

SSD Set System, Graph Decomposition and Hamiltonian Cycle
par: Shota, Kan, et autres
Publié: (2024)

Highly Connected Steiner Subgraph -- Parameterized Algorithms and Applications to Hitting Set Problems
par: Eiben, Eduard, et autres
Publié: (2023)

Enumeration of Bases in Matroid with Exponentially Large Ground Set
par: Nishimura, Yuki, et autres
Publié: (2025)

Breaking the Symmetries of Amenable Graphs
par: Cheng, Christine T.
Publié: (2025)

Monotonicity of the cops and robber game for bounded depth treewidth
par: Adler, Isolde, et autres
Publié: (2024)

A Tight Lower Bound on Cubic Vertices and Upper Bounds on Thin and Non-thin edges in Planar Braces
par: De, Koustav
Publié: (2025)

Revisiting classical results on kernels in digraphs
par: Langlois, Hélène, et autres
Publié: (2025)

Graph burning: an overview of mathematical programs
par: Cajica-Maceda, Lourdes Beatriz, et autres
Publié: (2025)

An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding
par: Ibrahimpur, Sharat, et autres
Publié: (2025)

Complexity of Firefighting on Graphs
par: Althoetmar, Julius, et autres
Publié: (2025)

Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic
par: Loth, Jesse Campion, et autres
Publié: (2022)

Minimizing an Uncrossed Collection of Drawings
par: Hliněný, Petr, et autres
Publié: (2023)

On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
par: MacRury, Calum, et autres
Publié: (2022)

Some Thoughts on Graph Similarity
par: Grohe, Martin
Publié: (2024)

Open Packing in Graphs: Bounds and Complexity
par: Shalu, M. A., et autres
Publié: (2024)

Every Graph is Essential to Large Treewidth
par: Alecu, Bogdan, et autres
Publié: (2025)

Recognizing Relating Edges in Graphs without Cycles of Length 6
par: Levit, Vadim E., et autres
Publié: (2024)

Graphs with no long claws: An improved bound for the analog of the Gyárfás' path argument
par: Bourneuf, Romain, et autres
Publié: (2025)

Monotonically Decreasing the Number of Directed 3-Cycles via Edge-Flips?
par: Bom, David, et autres
Publié: (2025)

The steady-states of splitter networks
par: Couëtoux, Basile, et autres
Publié: (2024)

On Minimum Maximal Distance-k Matchings
par: Kartynnik, Yury, et autres
Publié: (2016)

Deterministic Minimum Steiner Cut in Maximum Flow Time
par: Ding, Matthew, et autres
Publié: (2023)

Forward-backward Contention Resolution Schemes for Fair Rationing
par: Ma, Will, et autres
Publié: (2025)

A polynomial-time algorithm for recognizing high-bandwidth graphs
par: Varona, Luis M. B.
Publié: (2026)

Structural and Combinatorial Properties of 2-swap Word Permutation Graphs
par: Adamson, Duncan, et autres
Publié: (2023)

On the Uncrossed Number of Graphs
par: Balko, Martin, et autres
Publié: (2024)

A Polynomial Kernel for Vertex Deletion to the Scattered Class of Proper Interval Graph and Trees
par: Jacob, Ashwin, et autres
Publié: (2026)

Edge coloring lattice graphs
par: Kattemölle, Joris
Publié: (2024)

Partial Implementation of Max Flow and Min Cost Flow in Almost-Linear Time
par: Kavi, Nithin
Publié: (2024)

A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees
par: Jacob, Ashwin, et autres
Publié: (2024)