scientific article; zbMATH DE number 1323192
From MaRDI portal
Publication:4255109
zbMath0937.68092MaRDI QIDQ4255109
Publication date: 10 August 1999
Full work available at URL: http://www.library.uu.nl/digiarchief/dip/diss/01847381/inhoud.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (18)
A Basic Parameterized Complexity Primer ⋮ Kernelization – Preprocessing with a Guarantee ⋮ Fixed-Parameter Tractability of Treewidth and Pathwidth ⋮ Kernelization using structural parameters on sparse graph classes ⋮ Online promise problems with online width metrics ⋮ Characterizing width two for variants of 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 ⋮ Compact navigation and distance oracles for graphs with small treewidth ⋮ Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width ⋮ Unnamed Item ⋮ Hitting Forbidden Minors: Approximation and Kernelization ⋮ Bidimensionality and Kernels ⋮ Kernelization: New Upper and Lower Bound Techniques ⋮ Algorithms and obstructions for linear-width and related search parameters ⋮ Reduction algorithms for graphs of small treewidth ⋮ An improved algorithm for the jump number problem
This page was built for publication:
