Exact Algorithms for Edge Domination (Q3503591): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: DBLP publication ID (P1635): conf/iwpec/RooijB08, #quickstatements; #temporary_batch_1731468600454
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Hans L. Bodlaender / rank
Normal rank
 
Property / author
 
Property / author: Hans L. Bodlaender / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1531307275 / 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: Quasiconvex Analysis of 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: Branching and Treewidth Based Exact Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396567 / 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: 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: 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: 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: Exact Algorithms for Edge Domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4910758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In / 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
Property / Wikidata QID
 
Property / Wikidata QID: Q59567731 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: conf/iwpec/RooijB08 / rank
 
Normal rank

Latest revision as of 05:09, 13 November 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
    5 June 2008
    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

    Identifiers