Results 131 to 140 of about 5,860 (222)
Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth
, 1998 Torben Hagerup +3 more
openalex +1 more source
On Two Techniques of Combining Branching and Treewidth [PDF]
, 2007 Fedor V. Fomin +3 more
openalex +1 more source
The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths. [PDF]
Algorithmica, 2021 Ganian R, Ordyniak S.
europepmc +1 more source
Directed treewidth is closed under taking butterfly minors [PDF]
arXivButterfly minors are a generalisation of the minor containment relation for undirected graphs to directed graphs. Many results in directed structural graph theory use this notion as a central tool next to directed treewidth, a generalisation of the width measure treewidth to directed graphs.
arxiv
Treewidth of planar graphs: connections with duality
, 2001 Vincent Bouchitté +2 more
openalex +2 more sources
Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection. [PDF]
Theory Comput Syst, 2021 Mengel S, Skritek S.
europepmc +1 more source
Exact Algorithms for Treewidth and Minimum Fill-In [PDF]
, 2008 Fedor V. Fomin +3 more
openalex +1 more source
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. [PDF]
Algorithmica, 2021 Novotná J +5 more
europepmc +1 more source
Reduction Algorithms for Graphs of Small Treewidth
, 2001 Hans L. Bodlaender +1 more
openalex +1 more source
On treewidth and maximum cliques [PDF]
arXivWe construct classes of graphs that are variants of the so-called layered wheel. One of their key properties is that while the treewidth is bounded by a function of the clique number, the construction can be adjusted to make the dependance grow arbitrarily. Some of these classes provide counter-examples to several conjectures.
arxiv