Algorithmic aspects of upper edge domination
From MaRDI portal
Publication:2034795
Recommendations
- Algorithmic aspects of upper paired-domination in graphs
- Exact algorithms for edge domination
- Exact Algorithms for Edge Domination
- Algorithmic aspects of \textsc{Upper Domination}: a parameterised perspective
- scientific article; zbMATH DE number 1302196
- On the algorithmic complexity of edge total domination
- Upper domination: complexity and approximation
- Algorithmic aspects of some variants of domination in graphs
- On the computational complexity of upper total domination
- Total vertex-edge domination in graphs: Complexity and algorithms
Cites work
- A boundary property for upper domination
- A dichotomy for upper domination in monogenic classes
- Algorithmic aspects of \textsc{Upper Domination}: a parameterised perspective
- An Analysis of the Greedy Heuristic for Independence Systems
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
- Approximating edge dominating set in dense graphs
- Approximation algorithms for combinatorial problems
- Approximation hardness of edge dominating set problems
- Chordal graphs and upper irredundance, upper domination and independence
- Complexity of approximating bounded variants of optimization problems
- Contributions to the theory of domination, independence and irredundance in graphs
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability
- Edge Dominating Sets in Graphs
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- scientific article; zbMATH DE number 1559563 (Why is no real title available?)
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Minimum Edge Dominating Sets
- New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set
- Non-approximability results for optimization problems on bounded degree instances
- NP-completeness of some type of p-center problem
- On the complexity of the upper r-tolerant edge cover problem
- On the computational complexity of upper fractional domination
- Optimization, approximation, and complexity classes
- Paths, Trees, and Flowers
- Some APX-completeness results for cubic graphs
- Some simplified NP-complete graph problems
- The many facets of upper domination
- The Private Neighbor Cube
- The Rectilinear Steiner Tree Problem is NP-Complete
- Upper domination: complexity and approximation
- Upper domination: towards a dichotomy through boundary properties
- Weighted upper edge cover: complexity and approximability
- Weighted upper edge cover: complexity and approximability
Cited in
(12)- In memory of Jérôme Monnot
- Bounding and approximating minimum maximal matchings in regular graphs
- Algorithmic aspects of upper paired-domination in graphs
- Weighted upper edge cover: complexity and approximability
- Weighted upper domination number
- Upper domination: complexity and approximation
- Algorithmic aspects of \textsc{Upper Domination}: a parameterised perspective
- Weighted upper edge cover: complexity and approximability
- SOFSEM 2006: Theory and Practice of Computer Science
- Extension of some edge graph problems: standard, parameterized and approximation complexity
- Upper Clique Transversals in Graphs
- MaxMin separation problems: FPT algorithms for st-separator and odd cycle transversal
This page was built for publication: Algorithmic aspects of upper edge domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2034795)
