scientific article; zbMATH DE number 1323192

MaRDI QIDQ4255109zbMATH OpenFDO

Authors Babette de Fluiter

Publication date 10 August 1999

Full work available at URL http://www.library.uu.nl/digiarchief/dip/diss/01847381/inhoud.htm

zbMATH Keywords

path decompositionpathwidthtreewidth

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Programming involving graphs or networks (90C35)

Recommendations

• Reduction algorithms for graphs of small treewidth
• Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
• scientific article; zbMATH DE number 176762

Cited in

(29)

• Shortest paths in digraphs of small treewidth. I: Sequential algorithms
• Algorithms and obstructions for linear-width and related search parameters
• An improved algorithm for the jump number problem
• Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
• Reduction algorithms for graphs of small treewidth
• Lower bounds for protrusion replacement by counting equivalence classes
• Sparse obstructions for minor-covering parameters
• Polynomial kernels for hitting forbidden minors under structural parameterizations
• Hitting forbidden minors: approximation and kernelization
• A basic parameterized complexity primer
• Kernelization -- preprocessing with a guarantee
• Fixed-parameter tractability of treewidth and pathwidth
• Bidimensionality and kernels
• Kernelization using structural parameters on sparse graph classes
• Characterizing width two for variants of treewidth
• Algorithms on Subtree Filament Graphs
• Kernelization: new upper and lower bound techniques
• Bicycles and Spanning Trees
• scientific article; zbMATH DE number 1031380 (Why is no real title available?)
• Shortest path queries in digraphs of small treewidth
• Compact navigation and distance oracles for graphs with small treewidth
• Data-compression for parametrized counting problems on sparse graphs
• scientific article; zbMATH DE number 7310159 (Why is no real title available?)
• Graph-Theoretic Concepts in Computer Science
• scientific article; zbMATH DE number 7716293 (Why is no real title available?)
• Dynamic algorithms for graphs with treewidth 2
• Algorithms for graphs of bounded treewidth via orthogonal range searching
• I/O-efficient algorithms for graphs of bounded treewidth
• Online promise problems with online width metrics

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4255109)