Exact algorithms for dominating set (Q411862): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2011.07.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2070684734 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59567585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bottom-Up Method and Fast Algorithms for max independent set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / 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: Q3396567 / 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: Combinatorial bounds via measure and conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the complexity of minimum dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the minimum dominating clique problem / 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: Q4910758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithms for Edge Domination / 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: Open problems around exact algorithms / rank
 
Normal rank

Latest revision as of 03:54, 5 July 2024

scientific article
Language Label Description Also known as
English
Exact algorithms for dominating set
scientific article

    Statements

    Exact algorithms for dominating set (English)
    0 references
    0 references
    0 references
    30 April 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    exact algorithms
    0 references
    exponential time algorithms
    0 references
    branch and reduce
    0 references
    measure and conquer
    0 references
    dominating set
    0 references
    computer aided algorithm design
    0 references
    0 references
    0 references