scientific article; zbMATH DE number 1302196
From MaRDI portal
Publication:4247463
zbMath1058.90524MaRDI QIDQ4247463
Publication date: 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (49)
Perfect edge domination and efficient edge domination in graphs ⋮ On the independent dominating set polytope ⋮ The weighted independent domination problem is NP-complete for chordal graphs ⋮ On the algorithmic complexity of edge total domination ⋮ Perfect secret sharing scheme based on vertex domination set ⋮ Some advances on the set covering polyhedron of circulant matrices ⋮ An efficient algorithm to solve the distancek-domination problem on permutation graphs ⋮ A linear-time algorithm for weighted paired-domination on block graphs ⋮ On dominating set polyhedra of circular interval graphs ⋮ On the \({k}\)-power domination of hypergraphs ⋮ On the algorithmic complexity of \(k\)-tuple total domination ⋮ Algorithmic aspects of paired disjunctive domination in graphs ⋮ Power domination in circular-arc graphs ⋮ On the dominating set polytope ⋮ Partitioning vertices into in- and out-dominating sets in digraphs ⋮ \(k\)-rainbow domatic numbers ⋮ NP-completeness and APX-completeness of restrained domination in graphs ⋮ Generalized power domination of graphs ⋮ ON SOME NEW GRACEFUL GRAPHS ⋮ 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 ⋮ Towards a new framework for domination ⋮ The algorithmic complexity of bondage and reinforcement problems in bipartite graphs ⋮ The upper bound on \(k\)-tuple domination numbers of graphs ⋮ An optimal algorithm to find minimum k-hop dominating set of interval graphs ⋮ Minimum 2-tuple dominating set of an interval graph ⋮ Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs ⋮ Variations of \(Y\)-dominating functions on graphs ⋮ The algorithmic complexity of mixed domination in graphs ⋮ Rainbow domination on trees ⋮ Paired-domination problem on distance-hereditary graphs ⋮ Power domination in graphs ⋮ A linear-time algorithm for paired-domination problem in strongly chordal graphs ⋮ Domination in distance-hereditary graphs ⋮ Minimum 2-tuple dominating set of permutation graphs ⋮ An efficient algorithm for distance total domination in block graphs ⋮ Power domination with bounded time constraints ⋮ \(k\)-power domination in block graphs ⋮ A polynomial-time algorithm for the paired-domination problem on permutation graphs ⋮ The \(k\)-power domination problem in weighted trees ⋮ \(k\)-tuple domination in graphs ⋮ An \(O(n+m)\) time algorithm for computing a minimum semitotal dominating set in an interval graph ⋮ Hardness results and approximation algorithms of \(k\)-tuple domination in graphs ⋮ An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs ⋮ Hardness results and approximation algorithms for (weighted) paired-domination in graphs ⋮ Distance paired-domination problems on subclasses of chordal graphs ⋮ A linear-time algorithm for paired-domination on circular-arc graphs
This page was built for publication:
