A refined exact algorithm for edge dominating set (Q477194): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2014.07.019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2105489680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerate and Measure: Improving Parameter Budget Management / 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: 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 measure & conquer approach for the analysis of exact algorithms / 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: 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: Efficiency in exponential time for domination-type problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for edge domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confining sets and avoiding bottleneck cases: a simple maximum independent set algorithm in degree-3 graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized edge dominating set in graphs with degree bounded by 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New parameterized algorithms for the edge dominating set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Dominating Sets in Graphs / rank
 
Normal rank

Latest revision as of 10:00, 9 July 2024

scientific article
Language Label Description Also known as
English
A refined exact algorithm for edge dominating set
scientific article

    Statements

    A refined exact algorithm for edge dominating set (English)
    0 references
    0 references
    0 references
    2 December 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    exact algorithm
    0 references
    edge dominating set
    0 references
    measure and conquer
    0 references
    0 references