Dynamic algorithms for graphs of bounded treewidth
From MaRDI portal
Publication:1578413
DOI10.1007/s004530010021zbMath0959.03019OpenAlexW2047153806MaRDI QIDQ1578413
Publication date: 24 April 2001
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004530010021
Graph theory (including graph drawing) in computer science (68R10) Logic in computer science (03B70) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (11)
Fixed-Parameter Tractability of Treewidth and Pathwidth ⋮ Query efficient implementation of graphs of bounded clique-width ⋮ How to compute digraph width measures on directed co-graphs ⋮ The behavior of clique-width under graph operations and graph transformations ⋮ A note on trees, tables, and algorithms ⋮ Recognizing hyperelliptic graphs in polynomial time ⋮ A $c^k n$ 5-Approximation Algorithm for Treewidth ⋮ On the treewidth of dynamic graphs ⋮ Comparing linear width parameters for directed graphs ⋮ Parallel preprocessing for path queries without concurrent reading. ⋮ Listing all potential maximal cliques of a graph
This page was built for publication: Dynamic algorithms for graphs of bounded treewidth
