Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs (Q2817880): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1007/978-3-319-42634-1_31 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2499511520 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Independent Set Problem in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum weight independent sets in hole- and dart-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: Weighted efficient domination in two subclasses of \(P_6\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / 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: Maximum weight independent sets in odd-hole-free graphs without dart or without bull / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum independent set problem in subclasses of subcubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of bull-free graphs I -- three-edge-paths with centers and anticenters / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of bull-free graphs II and III -- a summary / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of generalized clique packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On diameters and radii of bridged graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable sets in two subclasses of banner-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: Weighted independent sets in a subclass of \(P_6\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum weight independent sets in classes related to claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New sufficient conditions for \(\alpha\)-redundant vertices / 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: Graphs without large apples and the maximum weight independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum independent set problem in subclasses of subcubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Weight Stable Set Problem in ( $$P_6$$ , bull)-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of subcubic planar graphs for which the independent set problem is polynomially solvable / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal independent sets of vertices in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing bull-free perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial Turing-kernel for weighted independent set in bull-free graphs / rank
 
Normal rank

Latest revision as of 13:02, 12 July 2024

scientific article
Language Label Description Also known as
English
Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs
scientific article

    Statements

    Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs (English)
    0 references
    0 references
    0 references
    2 September 2016
    0 references
    graph algorithms
    0 references
    weighted independent set
    0 references
    modular decomposition
    0 references
    claw-free graph
    0 references
    fork-free graph
    0 references
    bull-free graph
    0 references
    0 references

    Identifiers