Results 11 to 20 of about 3,161 (171)
On the pathwidth of hyperbolic 3-manifolds [PDF]
Comput. Geom. Topol., 2021 According to Mostow's celebrated rigidity theorem, the geometry of closed hyperbolic 3-manifolds is already determined by their topology. In particular, the volume of such manifolds is a topological invariant and, as such, has been investigated for half ...
Krist'of Husz'ar
semanticscholar +6 more sources
Kernel Bounds for Structural Parameterizations of Pathwidth [PDF]
, 2012 Assuming the AND-distillation conjecture, the Pathwidth problem of determining whether a given graph G has pathwidth at most k admits no polynomial kernelization with respect to k.
B. Monien +14 more
core +7 more sources
Pagenumber of pathwidth-k graphs and strong pathwidth-k graphs
Discrete Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Koichi Yamazaki, Mitsunori Togasaki
openaire +3 more sources
b-Coloring Parameterized by Pathwidth is XNLP-complete [PDF]
arXiv.org, 2022 We show that the $b$-Coloring problem is complete for the class XNLP when parameterized by the pathwidth of the input graph. Besides determining the precise parameterized complexity of this problem, this implies that b-Coloring parameterized by pathwidth
L. Jaffke +2 more
semanticscholar +3 more sources
Treewidth and pathwidth of permutation graphs [PDF]
SIAM Journal on Discrete Mathematics, 1993 This paper is the first one in a series of articles using scanlines in intersection models of graphs. The new concept enables to prove that every minimal triangulation of a permutation graph into a chordal graph is an interval graph, a result that generalizes to minimal triangulations of asteroidal-triple free graphs [Discrete Appl. Math.
Ton Kloks +2 more
+9 more sources
Pathwidth, trees, and random embeddings [PDF]
Combinatorica, 2013 We prove that, for every $k=1,2,...,$ every shortest-path metric on a graph of pathwidth $k$ embeds into a distribution over random trees with distortion at most $c$ for some $c=c(k)$. A well-known conjecture of Gupta, Newman, Rabinovich, and Sinclair states that for every minor-closed family of graphs $F$, there is a constant $c(F)$ such that the ...
James R. Lee, Anastasios Sidiropoulos
openaire +4 more sources
Approximation of pathwidth of outerplanar graphs [PDF]
Journal of Algorithms, 2001 Summary: There exists a polynomial time algorithm to compute the pathwidth of outerplanar graphs, but the large exponent makes this algorithm impractical. In this paper, we give an algorithm that, given a biconnected outerplanar graph \(G\), finds a path decomposition of \(G\) of pathwidth at most twice the pathwidth of \(G\) plus one.
Hans L. Bodlaender, Fedor V. Fomin
openaire +10 more sources
The pathwidth and treewidth of cographs [PDF]
SIAM Journal on Discrete Mathematics, 1990 Summary: It is shown that the pathwidth of a cograph equals its treewidth, and a linear time algorithm to determine the pathwidth of a cograph and build a corresponding path-decomposition is given.
Hans L. Bodlaender, Rolf H. Möhring
openaire +4 more sources
Bandwidth and pathwidth of three-dimensional grids
Discrete Mathematics, 2011 11 ...
Yota Otachi, Ryohei Suda
openaire +3 more sources
On the Pathwidth of Almost Semicomplete Digraphs [PDF]
, 2015 We call a digraph {\em $h$-semicomplete} if each vertex of the digraph has at most $h$ non-neighbors, where a non-neighbor of a vertex $v$ is a vertex $u \neq v$ such that there is no edge between $u$ and $v$ in either direction. This notion generalizes that of semicomplete digraphs which are $0$-semicomplete and tournaments which are semicomplete and ...
Kenta Kitsunai +2 more
openaire +4 more sources