Publication:4247463
From MaRDI portal
zbMath1058.90524MaRDI QIDQ4247463
Publication date: 1998
90C35: Programming involving graphs or networks
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Domination in distance-hereditary graphs, On the algorithmic complexity of \(k\)-tuple total domination, \(k\)-rainbow domatic numbers, NP-completeness and APX-completeness of restrained domination in graphs, Generalized power domination of graphs, The algorithmic complexity of mixed domination in graphs, Towards a new framework for domination, Minimum 2-tuple dominating set of an interval graph, The upper bound on \(k\)-tuple domination numbers of graphs, Variations of \(Y\)-dominating functions on graphs, Rainbow domination on trees, A linear-time algorithm for paired-domination problem in strongly chordal graphs, A polynomial-time algorithm for the paired-domination problem on permutation graphs, \(k\)-tuple domination in graphs, Hardness results and approximation algorithms of \(k\)-tuple domination in graphs, Hardness results and approximation algorithms for (weighted) paired-domination in graphs, Distance paired-domination problems on subclasses of chordal graphs, Perfect edge domination and efficient edge domination in graphs, The weighted independent domination problem is NP-complete for chordal graphs, Power domination in circular-arc graphs, On the independent dominating set polytope, On the dominating set polytope, Generalized perfect domination in graphs, Algorithmic aspect of stratified domination in graphs, Rainbow domination and related problems on strongly chordal graphs, Algorithmic aspects of the \(k\)-domination problem in graphs, The algorithmic complexity of bondage and reinforcement problems in bipartite graphs, Power domination in graphs, Minimum 2-tuple dominating set of permutation graphs, Some advances on the set covering polyhedron of circulant matrices
