scientific article
From MaRDI portal
Publication:3044360
zbMath1059.68598MaRDI QIDQ3044360
Jochen Alber, Rolf Niedermeier
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2286/22860613.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Data structures (68P05)
Related Items
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors, Counting Maximal Independent Sets in Subcubic Graphs, Graph Minors and Parameterized Algorithm Design, On the k-rainbow domination in graphs with bounded tree-width, Courcelle's theorem -- a game-theoretic approach, Structural parameters, tight bounds, and approximation for \((k, r)\)-center, Weighted maximum-clique transversal sets of graphs, How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms, On independent sets and bicliques in graphs, Dual parameterization and parameterized approximability of subset graph problems, Tree decompositions of graphs: saving memory in dynamic programming, Improved algorithms and complexity results for power domination in graphs, Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm, Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs, Dynamic programming and planarity: improved tree-decomposition based algorithms, Graphs, branchwidth, and tangles! Oh my!, Star partitions on graphs, Tree-decompositions of small pathwidth, The complexity ecology of parameters: An illustration using bounded max leaf number, Branch decompositions and minor containment, The parameterized complexity of the induced matching problem, Unnamed Item
Uses Software
