New parameterized algorithms for the edge dominating set problem (Q392035): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q62041768, #quickstatements; #temporary_batch_1711234560214
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Enumerate and Measure: Improving Parameter Budget Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation bounds for edge dominating set in dense graphs / 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: On two techniques of combining branching and treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-approximation algorithm for the minimum weight edge dominating set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generating all maximal independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques 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 Algorithms for Edge Domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Edge Dominating Set in Cubic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Refined Exact Algorithm for Edge Dominating Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Dominating Sets in Graphs / rank
 
Normal rank

Latest revision as of 06:02, 7 July 2024

scientific article
Language Label Description Also known as
English
New parameterized algorithms for the edge dominating set problem
scientific article

    Statements

    New parameterized algorithms for the edge dominating set problem (English)
    0 references
    0 references
    0 references
    0 references
    13 January 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph algorithms
    0 references
    parameterized algorithms
    0 references
    kernelization
    0 references
    edge dominating set
    0 references
    0 references
    0 references