Saved in:
| Main Authors: | Bellitto, T., Popper, J. Bouton, Escoffier, B. |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2502.14540 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Designing sparse temporal graphs satisfying connectivity requirements
by: Bellitto, Thomas, et al.
Published: (2026)
by: Bellitto, Thomas, et al.
Published: (2026)
Improved Dynamics for the Maximum Common Subgraph Problem
by: Guidobene, Davide, et al.
Published: (2024)
by: Guidobene, Davide, et al.
Published: (2024)
On the Confluence of Directed Graph Reductions Preserving Feedback Vertex Set Minimality
by: Abdenbi, Moussa, et al.
Published: (2024)
by: Abdenbi, Moussa, et al.
Published: (2024)
Highly Connected Steiner Subgraph -- Parameterized Algorithms and Applications to Hitting Set Problems
by: Eiben, Eduard, et al.
Published: (2023)
by: Eiben, Eduard, et al.
Published: (2023)
An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding
by: Ibrahimpur, Sharat, et al.
Published: (2025)
by: Ibrahimpur, Sharat, et al.
Published: (2025)
Binary Stretch Embedding of Weighted Graphs
by: Ebrahimi, Javad B., et al.
Published: (2024)
by: Ebrahimi, Javad B., et al.
Published: (2024)
A Tight Lower Bound on Cubic Vertices and Upper Bounds on Thin and Non-thin edges in Planar Braces
by: De, Koustav
Published: (2025)
by: De, Koustav
Published: (2025)
Revisiting classical results on kernels in digraphs
by: Langlois, Hélène, et al.
Published: (2025)
by: Langlois, Hélène, et al.
Published: (2025)
An Upper Bound for the Double Domination Number in Maximal Outerplanar Graphs
by: Araki, Toru
Published: (2026)
by: Araki, Toru
Published: (2026)
Monotonicity of the cops and robber game for bounded depth treewidth
by: Adler, Isolde, et al.
Published: (2024)
by: Adler, Isolde, et al.
Published: (2024)
Improving the Crossing Lemma by Characterizing Dense 2-Planar and 3-Planar Graphs
by: Büngener, Aaron, et al.
Published: (2024)
by: Büngener, Aaron, et al.
Published: (2024)
A polynomial-time algorithm for recognizing high-bandwidth graphs
by: Varona, Luis M. B.
Published: (2026)
by: Varona, Luis M. B.
Published: (2026)
New Results on Edge-coloring and Total-coloring of Split Graphs
by: Couto, Fernanda, et al.
Published: (2023)
by: Couto, Fernanda, et al.
Published: (2023)
On the hull and interval numbers of oriented graphs
by: Araujo, J., et al.
Published: (2022)
by: Araujo, J., et al.
Published: (2022)
Breaking the Symmetries of Amenable Graphs
by: Cheng, Christine T.
Published: (2025)
by: Cheng, Christine T.
Published: (2025)
Forward-backward Contention Resolution Schemes for Fair Rationing
by: Ma, Will, et al.
Published: (2025)
by: Ma, Will, et al.
Published: (2025)
On Minimum Maximal Distance-k Matchings
by: Kartynnik, Yury, et al.
Published: (2016)
by: Kartynnik, Yury, et al.
Published: (2016)
Deterministic Minimum Steiner Cut in Maximum Flow Time
by: Ding, Matthew, et al.
Published: (2023)
by: Ding, Matthew, et al.
Published: (2023)
The steady-states of splitter networks
by: Couëtoux, Basile, et al.
Published: (2024)
by: Couëtoux, Basile, et al.
Published: (2024)
Graph burning: an overview of mathematical programs
by: Cajica-Maceda, Lourdes Beatriz, et al.
Published: (2025)
by: Cajica-Maceda, Lourdes Beatriz, et al.
Published: (2025)
Enumeration of Bases in Matroid with Exponentially Large Ground Set
by: Nishimura, Yuki, et al.
Published: (2025)
by: Nishimura, Yuki, et al.
Published: (2025)
Searching in trees with $k$-up-modular cost functions
by: Szyfelbein, Michał
Published: (2025)
by: Szyfelbein, Michał
Published: (2025)
Edge coloring lattice graphs
by: Kattemölle, Joris
Published: (2024)
by: Kattemölle, Joris
Published: (2024)
On star-$k$-PCGs: Exploring class boundaries for small $k$ values
by: Monti, Angelo, et al.
Published: (2022)
by: Monti, Angelo, et al.
Published: (2022)
Partial Implementation of Max Flow and Min Cost Flow in Almost-Linear Time
by: Kavi, Nithin
Published: (2024)
by: Kavi, Nithin
Published: (2024)
On the Parameterized Tractability of Packing Vertex-Disjoint A-Paths with Length Constraints
by: Bandopadhyay, Susobhan, et al.
Published: (2026)
by: Bandopadhyay, Susobhan, et al.
Published: (2026)
A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees
by: Jacob, Ashwin, et al.
Published: (2024)
by: Jacob, Ashwin, et al.
Published: (2024)
NP-Completeness of the Combinatorial Distance Matrix Realisation Problem
by: Fairbairn, David L., et al.
Published: (2024)
by: Fairbairn, David L., et al.
Published: (2024)
Expanded-clique graphs and the domination problem
by: Dourado, Mitre C., et al.
Published: (2022)
by: Dourado, Mitre C., et al.
Published: (2022)
Slow Convergence of Ising and Spin Glass Models with Well-Separated Frustrated Vertices
by: Gillman, David, et al.
Published: (2026)
by: Gillman, David, et al.
Published: (2026)
Complexity of Firefighting on Graphs
by: Althoetmar, Julius, et al.
Published: (2025)
by: Althoetmar, Julius, et al.
Published: (2025)
On λ-backbone coloring of cliques with tree backbones in linear time
by: Michalik, Krzysztof, et al.
Published: (2021)
by: Michalik, Krzysztof, et al.
Published: (2021)
Online Bipartite Matching in the Probe-Commit Model
by: Borodin, Allan, et al.
Published: (2023)
by: Borodin, Allan, et al.
Published: (2023)
Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities
by: Ma, Will, et al.
Published: (2024)
by: Ma, Will, et al.
Published: (2024)
On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
by: MacRury, Calum, et al.
Published: (2022)
by: MacRury, Calum, et al.
Published: (2022)
Singular Values Versus Expansion in Directed and Undirected Graphs
by: Ruotolo, Jake, et al.
Published: (2025)
by: Ruotolo, Jake, et al.
Published: (2025)
Graphs with no long claws: An improved bound for the analog of the Gyárfás' path argument
by: Bourneuf, Romain, et al.
Published: (2025)
by: Bourneuf, Romain, et al.
Published: (2025)
Every Graph is Essential to Large Treewidth
by: Alecu, Bogdan, et al.
Published: (2025)
by: Alecu, Bogdan, et al.
Published: (2025)
Recognizing Relating Edges in Graphs without Cycles of Length 6
by: Levit, Vadim E., et al.
Published: (2024)
by: Levit, Vadim E., et al.
Published: (2024)
Some Thoughts on Graph Similarity
by: Grohe, Martin
Published: (2024)
by: Grohe, Martin
Published: (2024)
Similar Items
-
Designing sparse temporal graphs satisfying connectivity requirements
by: Bellitto, Thomas, et al.
Published: (2026) -
Improved Dynamics for the Maximum Common Subgraph Problem
by: Guidobene, Davide, et al.
Published: (2024) -
On the Confluence of Directed Graph Reductions Preserving Feedback Vertex Set Minimality
by: Abdenbi, Moussa, et al.
Published: (2024) -
Highly Connected Steiner Subgraph -- Parameterized Algorithms and Applications to Hitting Set Problems
by: Eiben, Eduard, et al.
Published: (2023) -
An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding
by: Ibrahimpur, Sharat, et al.
Published: (2025)