Image de couverture de livre

An improved spectral lower bound of treewidth

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Gima, Tatsuya, Hanaka, Tesshu, Noro, Kohei, Ono, Hirotaka, Otachi, Yota
Format:	Preprint
Publié:	2024
Sujets:	Combinatorics 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

Structural Parameterizations of Vertex Integrity
par: Gima, Tatsuya, et autres
Publié: (2023)

Treewidth of the $n \times n$ toroidal grid
par: Gima, Tatsuya, et autres
Publié: (2026)

Finding a Maximum Common (Induced) Subgraph: Structural Parameters Revisited
par: Hanaka, Tesshu, et autres
Publié: (2025)

Forcing a unique minimum spanning tree and a unique shortest path
par: Gima, Tatsuya, et autres
Publié: (2025)

On the complexity of finding a spanning even tree in a graph
par: Hanaka, Tesshu, et autres
Publié: (2024)

Dichotomies for Tree Minor Containment with Structural Parameters
par: Gima, Tatsuya, et autres
Publié: (2023)

Hitting Geodesic Intervals in Structurally Restricted Graphs
par: Gima, Tatsuya, et autres
Publié: (2025)

Broadcasting under Structural Restrictions
par: Egami, Yudai, et autres
Publié: (2025)

Algorithms for Optimally Shifting Intervals under Intersection Graph Models
par: Honorato-Droguett, Nicolás, et autres
Publié: (2023)

On the Complexity of Minimising the Moving Distance for Dispersing Objects
par: Honorato-Droguett, Nicolás, et autres
Publié: (2025)

Sequentially Swapping Tokens: Further on Graph Classes
par: Kiya, Hironori, et autres
Publié: (2022)

Computing diverse pair of solutions for tractable SAT
par: Gima, Tatsuya, et autres
Publié: (2024)

Hedonic Seat Arrangement Problems
par: Bodlaender, Hans L., et autres
Publié: (2020)

Spanning tree congestion of proper interval graphs
par: Otachi, Yota
Publié: (2026)

Finding subdigraphs in digraphs of bounded directed treewidth
par: Lopes, Raul, et autres
Publié: (2025)

On the Complexity of Secluded Path Problems
par: Hanaka, Tesshu, et autres
Publié: (2026)

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
par: Bonamy, Marthe, et autres
Publié: (2022)

Biclique Reconfiguration in Bipartite Graphs
par: Otachi, Yota, et autres
Publié: (2026)

Structural Parameters for Steiner Orientation
par: Hanaka, Tesshu, et autres
Publié: (2025)

Finding a Minimum Spanning Tree with a Small Non-Terminal Set
par: Hanaka, Tesshu, et autres
Publié: (2023)

Finding Induced Subgraphs from Graphs with Small Mim-Width
par: Otachi, Yota, et autres
Publié: (2024)

Parameterized complexity of isometric path partition: treewidth and diameter
par: Chakraborty, Dibyayan, et autres
Publié: (2025)

Parameterized Vertex Integrity Revisited
par: Hanaka, Tesshu, et autres
Publié: (2024)

Courcelle's Theorem for Lipschitz Continuity
par: Gima, Tatsuya, et autres
Publié: (2025)

Structural Parameterizations of $k$-Planarity
par: Gima, Tatsuya, et autres
Publié: (2025)

Core Stability in Additively Separable Hedonic Games of Low Treewidth
par: Hanaka, Tesshu, et autres
Publié: (2024)

Lower bounds on collective additive spanners
par: Corneil, Derek G., et autres
Publié: (2025)

The Leafed Induced Subtree in chordal and bounded treewidth graphs
par: Baste, Julien
Publié: (2023)

Faster diameter computation in graphs of bounded Euler genus
par: Kluk, Kacper, et autres
Publié: (2025)

Non-adaptive Bellman-Ford: Yen's improvement is optimal
par: Hu, Jialu, et autres
Publié: (2024)

Lower bounds for graph reconstruction with maximal independent set queries
par: Michel, Lukas, et autres
Publié: (2024)

Testing H-freeness on sparse graphs, the case of bounded expansion
par: Humeau, Samuel, et autres
Publié: (2025)

Making an oriented graph acyclic using inversions of bounded or prescribed size
par: Bang-Jensen, Jørgen, et autres
Publié: (2025)

Sparse induced subgraphs in $P_7$-free graphs of bounded clique number
par: Chudnovsky, Maria, et autres
Publié: (2024)

An unconditional lower bound for the active-set method on the hypercube
par: Disser, Yann, et autres
Publié: (2025)

Finding sparse induced subgraphs on graphs of bounded induced matching treewidth
par: Bodlaender, Hans L., et autres
Publié: (2025)

An unconditional lower bound for the active-set method in convex quadratic maximization
par: Bach, Eleon, et autres
Publié: (2025)

Interval Graphs are Reconstructible
par: Heinrich, Irene, et autres
Publié: (2025)

Better coloring of 3-colorable graphs
par: Kawarabayashi, Ken-ichi, et autres
Publié: (2024)

The Complexity of Maximal/Closed Frequent Tree Mining for Bounded Height Trees
par: Komoto, Kenta, et autres
Publié: (2026)