Fast algorithms for max independent set (Q2428670): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Nicolas Bourgeois / rank
Normal rank
 
Property / author
 
Property / author: Bruno Escoffier / rank
Normal rank
 
Property / author
 
Property / author: Nicolas Bourgeois / rank
 
Normal rank
Property / author
 
Property / author: Bruno Escoffier / rank
 
Normal rank
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.1007/s00453-010-9460-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2044104853 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O *(1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Independent Set in Graphs of Average Degree at Most Three in ${\mathcal O}(1.08537^n)$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4506265 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting models for 2SAT and 3SAT formulae / 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: On two techniques of combining branching and treewidth / 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: Algorithms for Counting 2-Sat Solutions and Colorings with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871161 / 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: A new approach to proving upper bounds for MAX-2-SAT / 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: Q4910758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414647 / rank
 
Normal rank

Latest revision as of 03:36, 5 July 2024

scientific article
Language Label Description Also known as
English
Fast algorithms for max independent set
scientific article

    Statements

    Fast algorithms for max independent set (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    26 April 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    bottom-up method
    0 references
    max independent set
    0 references
    exact algorithms
    0 references
    0 references