An algorithm for the maximum weight independent set problem on outerstring graphs (Q680149): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Label placement by maximum independent set in rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the rectangle escape problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The clique problem in ray intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph is the intersection graph of segments in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection graphs of curves in the plane / 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: Maximum Independent Set in 2-Direction Outersegment Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: String graphs and incomparability graphs / 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: Maximum weight independent sets and cliques in intersection graphs of filaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparability graphs and intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: String graphs. I: The number of critical nonstring graphs is infinite / rank
 
Normal rank
Property / cites work
 
Property / cites work: String graphs. II: Recognizing string graphs is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3745859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noncrossing Subgraphs in Topological Layouts / rank
 
Normal rank
Property / cites work
 
Property / cites work: String graphs requiring exponential representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3348944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The max clique problem in classes of string-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing string graphs in NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology of Thin Film RC Circuits / rank
 
Normal rank

Latest revision as of 23:42, 14 July 2024

scientific article
Language Label Description Also known as
English
An algorithm for the maximum weight independent set problem on outerstring graphs
scientific article

    Statements

    An algorithm for the maximum weight independent set problem on outerstring graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 January 2018
    0 references
    outerstring graphs
    0 references
    maximum weight independent set
    0 references
    outersegment graphs
    0 references

    Identifiers