Results 141 to 150 of about 4,776 (247)
Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020. [PDF]
Algorithmica, 2022 Gąsieniec L, Klasing R, Radzik T.
europepmc +1 more source
Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth
, 1998 Torben Hagerup +3 more
openalex +1 more source
Graph Treewidth and Geometric Thickness Parameters [PDF]
, 2006 Vida Dujmović, David R. Wood
openalex +1 more source
On Two Techniques of Combining Branching and Treewidth [PDF]
, 2007 Fedor V. Fomin +3 more
openalex +1 more source
Faster algorithms for counting subgraphs in sparse graphs. [PDF]
Algorithmica, 2021 Bressan M.
europepmc +1 more source
Reduction Algorithms for Graphs of Small Treewidth
, 2001 Hans L. Bodlaender +1 more
openalex +1 more source
The Behavior of Tree-Width and Path-Width Under Graph Operations and Graph Transformations
AlgorithmsTree-width and path-width are well-known graph parameters. Many NP-hard graph problems admit polynomial-time solutions when restricted to graphs of bounded tree-width or bounded path-width. In this work, we study the behavior of tree-width and path-width
Frank Gurski, Robin Weishaupt
doaj +1 more source
Treewidth of planar graphs: connections with duality
, 2001 Vincent Bouchitté +2 more
openalex +2 more sources
Exact Algorithms for Treewidth and Minimum Fill-In [PDF]
, 2008 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