Perfect edge domination and efficient edge domination in graphs
From MaRDI portal
Publication:1613347
DOI10.1016/S0166-218X(01)00198-6zbMATH Open0995.05108OpenAlexW2092503911MaRDI QIDQ1613347FDOQ1613347
Authors: Chin Lung Lu, Ming-Tat Ko, Chuan Yi Tang 
Publication date: 29 August 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(01)00198-6
Recommendations
- Solving the weighted efficient edge domination problem on bipartite permutation graphs
- Efficient edge domination problems in graphs
- scientific article; zbMATH DE number 4085682
- Practical algorithms on partial k-trees with an application to domination-like problems
- edge dominating set: Efficient Enumeration-Based Exact Algorithms
- scientific article; zbMATH DE number 637310
- scientific article; zbMATH DE number 1944139
- Dominating sets in perfect graphs
- Linear algorithms for edge-vertex domination in trees
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph Classes: A Survey
- A partial k-arboretum of graphs with bounded treewidth
- Planar 3DM is NP-complete
- Title not available (Why is that?)
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Graph minors. II. Algorithmic aspects of tree-width
- Parallel concepts in graph theory
- Treewidth. Computations and approximations
- Steiner trees, partial 2–trees, and minimum IFI networks
- The Recognition of Series Parallel Digraphs
- Title not available (Why is that?)
- Scheduling Interval-Ordered Tasks
- Algorithmic Aspects of Vertex Elimination on Graphs
- Edge Dominating Sets in Graphs
- Edge domination in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving the weighted efficient edge domination problem on bipartite permutation graphs
- Efficient edge domination problems in graphs
- Weighted independent perfect domination on cocomparability graphs
- The weighted perfect domination problem and its variants
- Topology of series-parallel networks
- A characterisation of rigid circuit graphs
- Weighted domination of cocomparability graphs
- Combinatorial algorithms on a class of graphs
- Polynomially bounded algorithms for locatingp-centers on a tree
- Title not available (Why is that?)
- THE PARALLEL ALGORITHMS FOR DETERMINING EDGE-PACKING AND EFFICIENT EDGE DOMINATING SETS IN INTERVAL GRAPHS
- Title not available (Why is that?)
- The edge domination problem
- Edge domination on bipartite permutation graphs and cotriangulated graphs
- Title not available (Why is that?)
- A linear algorithm for the domination number of a series-parallel graph
- Algorithmic aspects of majority domination
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (35)
- Minimum 2-tuple dominating set of permutation graphs
- Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs
- Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs
- A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs
- Extended formulations for perfect domination problems and their algorithmic implications
- Maximal matchings in polyspiro and benzenoid chains
- An optimal algorithm to find minimum k-hop dominating set of interval graphs
- Perfect edge domination: hard and solvable cases
- Dominating induced matchings in graphs without a skew star
- Efficient domination through eigenvalues
- Kernelization of edge perfect code and its variants
- The weighted perfect domination problem
- Dominating induced matchings for \(P_7\)-free graphs in linear time
- Efficient and perfect domination on circular-arc graphs
- On the complexity of the dominating induced matching problem in hereditary classes of graphs
- Finding dominating induced matchings in \(P_9\)-free graphs in polynomial time
- Finding dominating induced matchings in \(S_{2, 2, 3}\)-free graphs in polynomial time
- Maximal matching and edge domination in complete multipartite graphs
- The Maximum Number of Dominating Induced Matchings
- Efficient edge domination in regular graphs
- Finding dominating induced matchings in \(P_{10}\)-free graphs in polynomial time
- Efficient edge domination problems in graphs
- Modelling and solving the perfect edge domination problem
- Finding dominating induced matchings in \(S_{1, 1, 5}\)-free graphs in polynomial time
- Dominating induced matching in some subclasses of bipartite graphs
- Dominating induced matchings
- Graphs whose vertices of degree at least 2 lie in a triangle
- Fast algorithms for some dominating induced matching problems
- Exact algorithms for dominating induced matching based on graph partition
- Exact algorithms for minimum weighted dominating induced matching
- Efficient domination for classes of \(P_6\)-free graphs
- An optimal algorithm to find minimum \(k\)-hop connected dominating set of permutation graphs
- Complexity of simplicial homology and independence complexes of chordal graphs
- Dominating induced matchings in \(S_{1 , 2 , 4}\)-free graphs
- Finding dominating induced matchings in \(P_8\)-free graphs in polynomial time
This page was built for publication: Perfect edge domination and efficient edge domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1613347)
