Maximum weight independent sets in hole- and dart-free graphs (Q714022): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Manu Basavaraju / rank
Normal rank
 
Property / author
 
Property / author: Manu Basavaraju / 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.1016/j.dam.2012.06.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2027892020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum weight independent sets in hole- and co-chair-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New applications of clique separator decomposition for the maximum weight stable set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Sets of Maximum Weight in Apple-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure and stability number of \(P_{5}\)- and co-chair-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four classes of perfectly orderable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of generalized clique packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4093489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stable set problem in special \(P_{5}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for minimum weighted colouring of some classes of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm to find an independent set of maximum weight in a fork-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding large holes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition by clique separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686753 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:42, 5 July 2024

scientific article
Language Label Description Also known as
English
Maximum weight independent sets in hole- and dart-free graphs
scientific article

    Statements

    Maximum weight independent sets in hole- and dart-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    19 October 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    graph algorithms
    0 references
    maximum weight independent set problem
    0 references
    clique separators
    0 references
    hole-free graphs
    0 references
    dart-free greaphs
    0 references
    gem-free graphs
    0 references
    0 references