An exact algorithm for maximum independent set in degree-5 graphs (Q896662): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.dam.2014.07.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047009939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for max independent set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper bounds for vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / 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: A measure & conquer approach for the analysis of exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pathwidth of cubic graphs and exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(2<sup>0.304n</sup>) Algorithm for Solving Maximum Independent Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fine-grained Analysis of a Simple Independent Set Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3 / 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: Q4869540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Vertex Cover in Graphs with Maximum Degree 3 / 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: An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs / 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: Exact Algorithms for Maximum Independent Set / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:19, 11 July 2024

scientific article
Language Label Description Also known as
English
An exact algorithm for maximum independent set in degree-5 graphs
scientific article

    Statements

    An exact algorithm for maximum independent set in degree-5 graphs (English)
    0 references
    0 references
    0 references
    10 December 2015
    0 references
    exact algorithm
    0 references
    graph algorithm
    0 references
    maximum independent set
    0 references
    measure and conquer
    0 references
    amortized analysis
    0 references

    Identifiers