scientific article
From MaRDI portal
Publication:3822197
zbMath0669.05050MaRDI QIDQ3822197
Publication date: 1987
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) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
A recurrence template for several parameters in series-parallel graphs, Regularity and locality in \(k\)-terminal graphs, On Halin subgraphs and supergraphs, Parametric problems on graphs of bounded tree-width, Optimal parametric search on graphs of bounded tree-width, Fixed-Parameter Tractability of Treewidth and Pathwidth, Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs, MAXIMUM INDEPENDENT, MINIMALLY REDUNDANT SETS IN SERIES-PARALLEL GRAPHS, Unnamed Item, Scheduling of pipelined operator graphs, Dominating cycles in Halin graphs, On minimum dominating sets with minimum intersection, Practical algorithms for MSO model-checking on tree-decomposable graphs, Algorithms for recognition of regular properties and decomposition of recursive graph families, Cross-series-parallel digraphs, Monadic second-order evaluations on tree-decomposable graphs, Efficient sets in graphs, The efficiency of AC graphs, Locating facilities which interact: Some solvable cases, Tree decomposition and discrete optimization problems: a survey, The pagenumber of \(k\)-trees is \(O(k)\), Complexity of path-forming games, Efficiently parallelizable problems on a class of decomposable graphs, \(k\)-power domination in block graphs, Two strikes against perfect phylogeny, The \(k\)-power domination problem in weighted trees, The strong domination problem in block graphs and proper interval graphs, Irredundance, On the computational complexity of upper fractional domination, A partial k-arboretum of graphs with bounded treewidth, Hardness results and approximation algorithms for (weighted) paired-domination in graphs, The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs, Nearly perfect sets in graphs, Restrained domination in graphs, Myhill-Nerode Methods for Hypergraphs, Bibliography on domination in graphs and some basic definitions of domination parameters, Roman \(\{2\}\)-domination problem in graphs
