:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Jauregui, Benjamin, Li, Jason, Montealegre, Pedro, Todinca, Ioan
Formato:	Preprint
Publicado:	2018
Materias:	Data Structures and Algorithms
Acceso en línea:	https://arxiv.org/abs/1805.10708
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Distributed Model Checking on Graphs of Bounded Treedepth
por: Fomin, Fedor V., et al.
Publicado: (2024)

Deterministic Even-Cycle Detection in Broadcast CONGEST
por: Fraigniaud, Pierre, et al.
Publicado: (2024)

What Can Be Computed Locally Revisited: First-Order Logic on Sparse Graphs in Distributed Computing
por: Blin, Lélia, et al.
Publicado: (2024)

Courcelle's Theorem for Lipschitz Continuity
por: Gima, Tatsuya, et al.
Publicado: (2025)

Tight Lieb-Robinson Bound for approximation ratio in Quantum Annealing
por: Braida, Arthur, et al.
Publicado: (2023)

Anti-crossings occurrence as exponentially closing gaps in Quantum Annealing
por: Braida, Arthur, et al.
Publicado: (2023)

Girth Approximations in the CONGEST Model
por: Chechik, Shiri, et al.
Publicado: (2026)

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

Deterministic Edge Coloring with few Colors in CONGEST
por: Blikstad, Joakim, et al.
Publicado: (2026)

On graphs coverable by k shortest paths
por: Dumas, Maël, et al.
Publicado: (2022)

Optimized 2-Approximation of Treewidth
por: Belbasi, Mahdi, et al.
Publicado: (2024)

Dynamic Treewidth in Logarithmic Time
por: Korhonen, Tuukka
Publicado: (2025)

Losing Treewidth In The Presence Of Weights
por: Włodarczyk, Michał
Publicado: (2024)

Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks
por: Gall, François Le, et al.
Publicado: (2018)

Visualizing Treewidth
por: Chiu, Alvin, et al.
Publicado: (2025)

Spanning and Metric Tree Covers Parameterized by Treewidth
por: Elkin, Michael, et al.
Publicado: (2025)

Improved Approximation Bounds for Minimum Weight Cycle in the CONGEST Model
por: Manoharan, Vignesh, et al.
Publicado: (2023)

E-Graphs as Circuits, and Optimal Extraction via Treewidth
por: Sun, Glenn, et al.
Publicado: (2024)

Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model
por: Manoharan, Vignesh, et al.
Publicado: (2022)

Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth
por: Wlodarczyk, Michal
Publicado: (2023)

Minimum Stable Cut and Treewidth
por: Lampis, Michael
Publicado: (2021)

Enumeration of Minimal Hitting Sets Parameterized by Treewidth
por: Kenig, Batya, et al.
Publicado: (2024)

Treewidth of the $n \times n$ toroidal grid
por: Gima, Tatsuya, et al.
Publicado: (2026)

Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter
por: Chalermsook, Parinya, et al.
Publicado: (2021)

Embedding Planar Graphs into Graphs of Treewidth $O(\log^{3} n)$
por: Chang, Hsien-Chih, et al.
Publicado: (2024)

Can You Link Up With Treewidth?
por: Curticapean, Radu, et al.
Publicado: (2024)

Treewidth Parameterized by Feedback Vertex Number
por: Molter, Hendrik, et al.
Publicado: (2025)

Residue Domination in Bounded-Treewidth Graphs
por: Greilhuber, Jakob, et al.
Publicado: (2024)

Faster Min-Cost Flow and Approximate Tree Decomposition on Bounded Treewidth Graphs
por: Dong, Sally, et al.
Publicado: (2023)

k-SUM Hardness Implies Treewidth-SETH
por: Lampis, Michael
Publicado: (2025)

Sparse Outerstring Graphs Have Logarithmic Treewidth
por: An, Shinwoo, et al.
Publicado: (2024)

Optimal Padded Decomposition For Bounded Treewidth Graphs
por: Filtser, Arnold, et al.
Publicado: (2024)

Generalized Graph Packing Problems Parameterized by Treewidth
por: Esmer, Barış Can, et al.
Publicado: (2025)

Separator Theorem for Minor-Free Graphs in Linear Time
por: Bonnet, Édouard, et al.
Publicado: (2025)

Snakes and Ladders: a Treewidth Story
por: Chaplick, Steven, et al.
Publicado: (2023)

Bilateral Treewidth for QBF: Where Strategies and Resolution Meet
por: Ganian, Robert, et al.
Publicado: (2026)

Deterministic Single Exponential Time Algorithms for Co-Path Packing and Co-Path Set Parameterized by Treewidth
por: Liu, Yuxi, et al.
Publicado: (2026)

Protrusion Decompositions Revisited: Uniform Lossy Kernels for Reducing Treewidth and Linear Kernels for Hitting Disconnected Minors
por: Sharma, Roohani, et al.
Publicado: (2026)

Efficient Algorithms for Interdicting Facilities in Trees and Bounded Treewidth Graphs
por: Abbasi, Ali, et al.
Publicado: (2026)

Breaking the Treewidth Barrier in Quantum Circuit Simulation with Decision Diagrams
por: Cheng, Bin, et al.
Publicado: (2025)