scientific article; zbMATH DE number 1302196
From MaRDI portal
Publication:4247463
zbMATH Open1058.90524MaRDI QIDQ4247463FDOQ4247463
Authors: Gerard Jennhwa Chang 
Publication date: 1998
Title of this publication is not available (Why is that?)
Recommendations
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Cited In (65)
- Using genetic algorithm for the discrete domination over time problem
- An efficient algorithm for distance total domination in block graphs
- Perfect secret sharing scheme based on vertex domination set
- Title not available (Why is that?)
- Leaf sector covers with applications on circle graphs
- Edge-vertex domination on interval graphs
- Algorithmic aspects of majority domination
- Title not available (Why is that?)
- On the algorithmic complexity of \(k\)-tuple total domination
- Power domination in circular-arc graphs
- Title not available (Why is that?)
- The algorithmic complexity of bondage and reinforcement problems in bipartite graphs
- A polynomial-time algorithm for the paired-domination problem on permutation graphs
- Title not available (Why is that?)
- A linear-time algorithm for paired-domination problem in strongly chordal graphs
- Title not available (Why is that?)
- Labeling algorithms for domination problems in sun-free chordal graphs
- Minimum 2-tuple dominating set of permutation graphs
- Algorithmic aspects of paired disjunctive domination in graphs
- Paired-domination problem on distance-hereditary graphs
- \(k\)-rainbow domatic numbers
- Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs
- The weighted independent domination problem is NP-complete for chordal graphs
- An optimal algorithm to find minimum k-hop dominating set of interval graphs
- On the algorithmic complexity of edge total domination
- The upper bound on \(k\)-tuple domination numbers of graphs
- Generalized power domination of graphs
- Algorithmic aspect of \(k\)-tuple domination in graphs.
- NP-completeness and APX-completeness of restrained domination in graphs
- The algorithmic complexity of mixed domination in graphs
- Towards a new framework for domination
- A linear-time algorithm for weighted paired-domination on block graphs
- Generalized perfect domination in graphs
- Algorithmic aspect of stratified domination in graphs
- Algorithmic aspects of upper edge domination
- On the independent dominating set polytope
- ON SOME NEW GRACEFUL GRAPHS
- Rainbow domination on trees
- \(k\)-tuple domination in graphs
- On the \({k}\)-power domination of hypergraphs
- Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
- A linear-time algorithm for paired-domination on circular-arc graphs
- Hardness results and approximation algorithms for (weighted) paired-domination in graphs
- Algorithmic aspects of the \(k\)-domination problem in graphs
- On dominating set polyhedra of circular interval graphs
- The \(k\)-power domination problem in weighted trees
- Distance paired-domination problems on subclasses of chordal graphs
- An \(O(n+m)\) time algorithm for computing a minimum semitotal dominating set in an interval graph
- Algorithmic aspects of total k-subdomination in graphs
- \(k\)-power domination in block graphs
- A Dynamic Programming Approach to the Dominating Set Problem on k-Trees
- Perfect edge domination and efficient edge domination in graphs
- Unsolved algorithmic problems on trees
- Power domination with bounded time constraints
- On the dominating set polytope
- An efficient algorithm to solve the distance \(k\)-domination problem on permutation graphs
- Domination in distance-hereditary graphs
- Some advances on the set covering polyhedron of circulant matrices
- Rainbow domination and related problems on strongly chordal graphs
- Fundamentals of Computation Theory
- Variations of \(Y\)-dominating functions on graphs
- Minimum 2-tuple dominating set of an interval graph
- Power domination in graphs
- An optimal algorithm to find minimum \(k\)-hop connected dominating set of permutation graphs
- Partitioning vertices into in- and out-dominating sets in digraphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4247463)
