Space-Efficient Vertex Separators for Treewidth
Work
Year: 2022
Type: article
Abstract: For n -vertex graphs with treewidth $$k = O(n^{1/2-\epsilon })$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>k</mml:mi> <mml:mo>=</mml:mo> <mml:mi>O</mml:mi> <mml:mo>... more
Source: Algorithmica
Institution Technische Hochschule Mittelhessen
Cites: 38
Cited by: 2
Related to: 10
FWCI: 0.361
Citation percentile (by year/subfield): 58.55
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
APC paid (est): $2,890
Grant ID 379157101