Extension of some edge graph problems: standard, parameterized and approximation complexity (Q6048430): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the Complexity Landscape of the Domination Chain / rank
 
Normal rank
Property / cites work
 
Property / cites work: The many facets of upper domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of the capacitated \(b\)-edge dominating set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for generalized edge dominating set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating sets for split and bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precoloring extension. I: Interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiently enumerating hitting sets of hypergraphs arising in data profiling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating Minimal Dominating Sets in Triangle-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual subimplicants of positive Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected vertex covers in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension of Vertex Cover and Independent Set in some classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension of some edge graph problems: standard and parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of solution extension of optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3132864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of completing partial Latin squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized enumeration, transversals, and imperfect phylogeny reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight approximation ratio for Minimum Maximal Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4808679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: edge dominating set: Efficient Enumeration-Based Exact Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5208373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex and edge covers with clustering properties: Complexity and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An incremental polynomial time algorithm to enumerate all minimal edge dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the upper \(r\)-tolerant edge cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-delay and polynomial-space enumeration of large maximal matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A special planar satisfiability problem and a consequence of its NP- completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects of upper edge domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for edge domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-approximability results for optimization problems on bounded degree instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4370201 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Dominating Sets in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank

Revision as of 20:48, 2 August 2024

scientific article; zbMATH DE number 7737619
Language Label Description Also known as
English
Extension of some edge graph problems: standard, parameterized and approximation complexity
scientific article; zbMATH DE number 7737619

    Statements

    Extension of some edge graph problems: standard, parameterized and approximation complexity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 September 2023
    0 references
    extension problems
    0 references
    edge cover
    0 references
    matching
    0 references
    edge domination
    0 references
    NP-completeness
    0 references
    parameterized complexity
    0 references
    approximation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references