Copertina

Trade-off between spread and width for tree decompositions

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Bodlaender, Hans L., Groenland, Carla
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Combinatorics Discrete Mathematics
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

On the parameterized complexity of computing tree-partitions
di: Bodlaender, Hans L., et al.
Pubblicazione: (2022)

Tree-partitions and small-spread tree-decompositions
di: Distel, Marc, et al.
Pubblicazione: (2026)

Faster 3-colouring algorithm for graphs of diameter 3
di: Groenland, Carla, et al.
Pubblicazione: (2026)

Tree decompositions with small width, spread, order and degree
di: Wood, David R.
Pubblicazione: (2025)

Quasi-linear distance query reconstruction for graphs of bounded treelength
di: Bastide, Paul, et al.
Pubblicazione: (2024)

On coarse tree decompositions and coarse balanced separators
di: Abrishami, Tara, et al.
Pubblicazione: (2025)

Tree decompositions whose trees are subgraphs: An application of Simon's factorization
di: Bourneuf, Romain, et al.
Pubblicazione: (2026)

Optimal distance query reconstruction for graphs without long induced cycles
di: Bastide, Paul, et al.
Pubblicazione: (2023)

Erd\H os--Ko--Rado type results for partitions via spread approximations
di: Kupavskii, Andrey
Pubblicazione: (2023)

Complexity results on the decomposition of a digraph into directed linear forests and out-stars
di: Hörsch, Florian, et al.
Pubblicazione: (2024)

Planar induced paths via a decomposition into non-crossing ordered graphs
di: Duron, Julien, et al.
Pubblicazione: (2025)

Blow-up structure of graphs excluding a tree or an apex-tree as a minor
di: Claus, Quentin, et al.
Pubblicazione: (2026)

How to see the forest for the trees
di: Bérczi-Kovács, Erika, et al.
Pubblicazione: (2025)

Labeling and folding multi-labeled trees
di: Moulton, Vincent, et al.
Pubblicazione: (2025)

Computational complexity of covering regular trees
di: Bok, Jan, et al.
Pubblicazione: (2025)

Conflict-free chromatic index of trees
di: Guo, Shanshan, et al.
Pubblicazione: (2024)

Bipartite Turán number of paths and other trees
di: Bonamy, Marthe, et al.
Pubblicazione: (2025)

On universal graphs for trees and treewidth $k$ graphs
di: Kaul, Neel, et al.
Pubblicazione: (2025)

$K_{2,3}$-induced minor-free graphs admit quasi-isometry with additive distortion to graphs of tree-width at most two
di: Chakraborty, Dibyayan
Pubblicazione: (2025)

A complete $t$-intersection theorem for families of spanning trees
di: Iarovikova, Elizaveta, et al.
Pubblicazione: (2025)

Listing spanning trees of outerplanar graphs by pivot-exchanges
di: Behrooznia, Nastaran, et al.
Pubblicazione: (2024)

Induced matching treewidth and tree-independence number, revisited
di: Alon, Noga, et al.
Pubblicazione: (2025)

Tight bound for the Erdős-Pósa property of tree minors
di: Dujmović, Vida, et al.
Pubblicazione: (2024)

Combinatorial generation via permutation languages. VI. Binary trees
di: Gregor, Petr, et al.
Pubblicazione: (2023)

tinygarden -- A java package for testing properties of spanning trees
di: Dubinsky, Manuel, et al.
Pubblicazione: (2024)

Network fault costs based on minimum leaf spanning trees
di: Goedgebeur, Jan, et al.
Pubblicazione: (2025)

Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
di: Beaudou, Laurent, et al.
Pubblicazione: (2025)

Concatenation trees: A framework for efficient universal cycle and de Bruijn sequence constructions
di: Sawada, J., et al.
Pubblicazione: (2023)

Internally-disjoint directed pendant Steiner trees with three terminal vertices in Cartesian product digraphs
di: Yu, Shanshan, et al.
Pubblicazione: (2026)

Trees and co-trees in planar 3-connected graphs An easier proof via Schnyder woods
di: Ortlieb, Christian, et al.
Pubblicazione: (2024)

On the periodic decompositions of multidimensional configurations
di: Herva, Pyry, et al.
Pubblicazione: (2024)

Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
di: Botler, Fábio, et al.
Pubblicazione: (2025)

Orthogonality between acyclic subdigraphs and paths in digraphs
di: Silva, Caroline A. de Paula, et al.
Pubblicazione: (2026)

On the Gap between Hereditary Discrepancy and the Determinant Lower Bound
di: Li, Lily, et al.
Pubblicazione: (2023)

Upper bounds on the average edit distance between two random strings
di: Rosenfeld, Matthieu
Pubblicazione: (2024)

Biclique immersions in graphs with independence number 2
di: Botler, Fábio, et al.
Pubblicazione: (2023)

Interaction between skew-representability, tensor products, extension properties, and rank inequalities
di: Bérczi, Kristóf, et al.
Pubblicazione: (2025)

Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs
di: Das, Sandip, et al.
Pubblicazione: (2023)

Twin-width of graphs on surfaces
di: Kráľ, Daniel, et al.
Pubblicazione: (2023)

Clique-width and induced topological minors
di: Bieliński, Paweł Rafał, et al.
Pubblicazione: (2026)