Iterative compression and exact algorithms (Q2268862): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q60488621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating maximal independent sets with applications to graph colouring. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for feedback vertex set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Parameterized Upper Bounds for Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cluster Editing Problem: Implementations and Experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(\mathcal O(2^{O(k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Parameterized Preprocessing for Cluster Editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms for Hitting Set: The Weighted Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measure and conquer / 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: A more effective linear kernelization for cluster editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Algorithms for Cluster Vertex Deletion / 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: Finding odd cycle transversals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for maximum independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Maximum Independent Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414647 / rank
 
Normal rank

Latest revision as of 13:25, 2 July 2024

scientific article
Language Label Description Also known as
English
Iterative compression and exact algorithms
scientific article

    Statements

    Iterative compression and exact algorithms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    9 March 2010
    0 references
    exponential time algorithms
    0 references
    graph algorithms
    0 references
    independent set
    0 references
    hitting set
    0 references
    induced cluster
    0 references
    fixed parameter algorithms
    0 references
    iterative compression
    0 references

    Identifiers