Exact algorithms for edge domination (Q1945174): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59567537, #quickstatements; #temporary_batch_1711055989931
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4699283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(2\frac{1}{10}\)-approximation algorithm for a generalization of the weighted edge-dominating set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4027320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / 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: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithms for Treewidth and Minimum Fill-In / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two techniques of combining branching and treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A measure &amp; conquer approach for the analysis of exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generating all maximal independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: New methods for 3-SAT decision and worst-case analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the complexity of the chromatic number problem / 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: On cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence between the minimum covering problem and the maximum matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained weighted matchings and edge coverings in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient exact algorithms through enumerating maximal independent sets and other techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Computation of Maximum Induced Forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for maximum independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency in exponential time for domination-type problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Maximum Independent Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4910758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inclusion/Exclusion Meets Measure and Conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and Exact Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Dominating Sets in Graphs / rank
 
Normal rank

Latest revision as of 08:33, 6 July 2024

scientific article
Language Label Description Also known as
English
Exact algorithms for edge domination
scientific article

    Statements

    Exact algorithms for edge domination (English)
    0 references
    0 references
    0 references
    0 references
    3 April 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    edge dominating set
    0 references
    minimum maximal matching
    0 references
    exact algorithms
    0 references
    exponential time algorithms
    0 references
    measure and conquer
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references