Approximating minimum coloring and maximum independent set in dotted interval graphs (Q844151): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q2921688 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Complexity of Coloring Circular Arcs and Chords / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient algorithms for interval graphs and circular-arc graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph / rank | |||
Normal rank |
Latest revision as of 10:00, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Approximating minimum coloring and maximum independent set in dotted interval graphs |
scientific article |
Statements
Approximating minimum coloring and maximum independent set in dotted interval graphs (English)
0 references
18 January 2010
0 references
approximation algorithms
0 references
dotted interval graph
0 references
intersection graph
0 references
minimum coloring
0 references
maximum independent set
0 references
microsatellite genotyping
0 references
0 references