On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem (Q385962): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2013.11.019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2013909012 / 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: On algorithms for (\(P_5\), gem)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: New graph classes of bounded clique-width / 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: On independent vertex sets in subclasses of apple-free graphs / 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: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On variations of \(P_{4}\)-sparse 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 complexity of generalized clique packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3676177 / 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: Vertex Disjoint Paths for Dispatching in Railways. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4093489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: <i>P</i><sub>4</sub>-Reducible Graphs-Class of Uniquely Tree-Representable 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: On maximal independent sets of vertices in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Mining with optimized two-dimensional association rules / 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

Latest revision as of 03:32, 7 July 2024

scientific article
Language Label Description Also known as
English
On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem
scientific article

    Statements

    On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem (English)
    0 references
    0 references
    13 December 2013
    0 references
    graph algorithms
    0 references
    clique separators
    0 references
    modular decomposition
    0 references
    maximum weight independent set problem
    0 references
    \(P_5\)-free graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references