Finding hidden independent sets in interval graphs (Q1884976): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57690021, #quickstatements; #temporary_batch_1712569514456
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The complexity of coloring games on perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501678 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a combinatorial game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Flow and Testing Graph Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal aggregation algorithms for middleware. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching and pebbling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection graphs of segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient construction of a small hitting set for combinatorial rectangles in high dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138414 / rank
 
Normal rank

Revision as of 14:52, 7 June 2024

scientific article
Language Label Description Also known as
English
Finding hidden independent sets in interval graphs
scientific article

    Statements

    Finding hidden independent sets in interval graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 October 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Games
    0 references
    Interval graphs
    0 references
    Independent set
    0 references
    Adaptive algorithms
    0 references
    Gene finding
    0 references
    Battleship
    0 references
    0 references