Results 161 to 170 of about 4,776 (247)
Achievable sets, brambles, and sparse treewidth obstructions
, 2007 Brian Lucena
openalex +1 more source
Integer linear programming formulations for treewidth [PDF]
, 2011 Alexander Grigoriev +2 more
openalex +1 more source
Exact and parameterized algorithms for choosability. [PDF]
Acta InformBliznets I, Nederlof J.
europepmc +1 more source
Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts
, 2023 Anagnostides I +4 more
europepmc +1 more source
A tourist guide through treewidth
Acta Cybernetica, 1992 Summary: A short overview is given of many recent results in algorithmic graph theory that deal with the notions treewidth and pathwidth. We discuss algorithms that find tree-decompositions, algorithms that use tree- decompositions to solve hard problems efficiently, graph minor theory, and some applications.
openaire +4 more sources
Romeo and Juliet Meeting in Forest Like Regions
, 2023 Misra N, Mulpuri M, Tale P, Viramgami G.
europepmc +1 more source
On the expressive power of planar perfect matching and permanents of bounded treewidth matrices
, 2007 Laurent Lyaudet +2 more
openalex +2 more sources
Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm
, 2008 Frederic Dorn, Jan Arne Telle
openalex +1 more source
A linear time algorithm for finding tree-decompositions of small treewidth
Symposium on the Theory of Computing, 1993 H. Bodlaender
semanticscholar +1 more source