Copertina

The Leafed Induced Subtree in chordal and bounded treewidth graphs

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Baste, Julien
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Composing dynamic programming tree-decomposition-based algorithms
di: Baste, Julien
Pubblicazione: (2019)

Finding sparse induced subgraphs on graphs of bounded induced matching treewidth
di: Bodlaender, Hans L., et al.
Pubblicazione: (2025)

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
di: Bonamy, Marthe, et al.
Pubblicazione: (2022)

An improved spectral lower bound of treewidth
di: Gima, Tatsuya, et al.
Pubblicazione: (2024)

Subtree Mode and Applications
di: Zhou, Jialong, et al.
Pubblicazione: (2025)

List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs
di: Esmer, Barış Can, et al.
Pubblicazione: (2022)

Finding subdigraphs in digraphs of bounded directed treewidth
di: Lopes, Raul, et al.
Pubblicazione: (2025)

Polynomial-time algorithms for PATH COVER and PATH PARTITION on trees and graphs of bounded treewidth
di: Foucaud, Florent, et al.
Pubblicazione: (2025)

Liar's vertex-edge domination in subclasses of chordal graphs
di: Bhattacharya, Debojyoti, et al.
Pubblicazione: (2025)

Detection of Common Subtrees with Identical Label Distribution
di: Azaïs, Romain, et al.
Pubblicazione: (2023)

Polynomial kernels for edge modification problems towards block and strictly chordal graphs
di: Dumas, Maël, et al.
Pubblicazione: (2022)

A column generation algorithm for finding co-3-plexes in chordal graphs
di: Dupont-Bouillard, Alexandre
Pubblicazione: (2026)

Enumerating minimal dominating sets and variants in chordal bipartite graphs
di: Castelo, Emanuel, et al.
Pubblicazione: (2025)

Upper bounds on the theta function of random graphs
di: Feige, Uriel, et al.
Pubblicazione: (2025)

A characterization of one-sided error testable graph properties in bounded degeneracy graphs
di: Lachish, Oded, et al.
Pubblicazione: (2026)

Testing $C_k$-freeness in bounded-arboricity graphs
di: Eden, Talya, et al.
Pubblicazione: (2024)

Parameterized complexity of isometric path partition: treewidth and diameter
di: Chakraborty, Dibyayan, et al.
Pubblicazione: (2025)

Pre-assignment problem for unique minimum vertex cover on bounded clique-width graphs
di: An, Shinwoo, et al.
Pubblicazione: (2024)

Faster diameter computation in graphs of bounded Euler genus
di: Kluk, Kacper, et al.
Pubblicazione: (2025)

Root-to-Leaf Scheduling in Write-Optimized Trees
di: Chung, Christopher, et al.
Pubblicazione: (2024)

Testing H-freeness on sparse graphs, the case of bounded expansion
di: Humeau, Samuel, et al.
Pubblicazione: (2025)

Lower bounds for graph reconstruction with maximal independent set queries
di: Michel, Lukas, et al.
Pubblicazione: (2024)

Making an oriented graph acyclic using inversions of bounded or prescribed size
di: Bang-Jensen, Jørgen, et al.
Pubblicazione: (2025)

Sparse induced subgraphs in $P_7$-free graphs of bounded clique number
di: Chudnovsky, Maria, et al.
Pubblicazione: (2024)

Packing $K_r$s in bounded degree graphs
di: McKay, Michael, et al.
Pubblicazione: (2022)

Lower bounds on pure dynamic programming for connectivity problems on graphs of bounded path-width
di: Kluk, Kacper, et al.
Pubblicazione: (2025)

A $\frac{4}{3}$-Approximation for the Maximum Leaf Spanning Arborescence Problem in DAGs
di: Neuwohner, Meike
Pubblicazione: (2024)

Quantum algorithms and lower bounds for eccentricity, radius, and diameter in undirected graphs
di: Wesołowski, Adam, et al.
Pubblicazione: (2025)

Height-bounded Lempel-Ziv encodings
di: Bannai, Hideo, et al.
Pubblicazione: (2024)

Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs
di: Bencs, Ferenc, et al.
Pubblicazione: (2025)

Optimal bounds on a tree inference algorithm
di: Gardiner, Jack, et al.
Pubblicazione: (2024)

Improved bounds for group testing in arbitrary hypergraphs
di: De Bonis, Annalisa
Pubblicazione: (2024)

A basic lower bound for property testing
di: Fischer, Eldar
Pubblicazione: (2024)

Clique-free t-matchings in degree-bounded graphs
di: Paluch, Katarzyna, et al.
Pubblicazione: (2024)

Differentially private graph coloring
di: Xie, Michael, et al.
Pubblicazione: (2026)

Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming
di: Kacham, Praneeth, et al.
Pubblicazione: (2023)

Tight bounds for the sensitivity of CDAWGs with left-end edits
di: Fujimaru, Hiroto, et al.
Pubblicazione: (2023)

The trace reconstruction problem for spider graphs
di: Sun, Alec, et al.
Pubblicazione: (2022)

The Canadian Traveller Problem on outerplanar graphs
di: Beaudou, Laurent, et al.
Pubblicazione: (2024)

Private graph colouring with limited defectiveness
di: Christiansen, Aleksander B. G., et al.
Pubblicazione: (2024)