Results 141 to 150 of about 4,791 (239)
Faster algorithms for counting subgraphs in sparse graphs. [PDF]
Algorithmica, 2021 Bressan M.
europepmc +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
Approximation metatheorem for fractionally treewidth-fragile graphs. [PDF]
, 2021 Zdenĕk Dvořák
openalex
Hardness of Metric Dimension in Graphs of Constant Treewidth [PDF]
, 2021 Shaohua Li, Marcin Pilipczuk
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
Fine-grained complexity of the graph homomorphism problem for\n bounded-treewidth graphs [PDF]
, 2019 Karolina Okrasa, Paweł Rzążewski
openalex +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
Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection. [PDF]
Theory Comput Syst, 2021 Mengel S, Skritek S.
europepmc +1 more source
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. [PDF]
Algorithmica, 2021 Novotná J +5 more
europepmc +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