Efficient algorithms for interval graphs and circular-arc graphs (Q3956413): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 14:40, 5 March 2024

scientific article
Language Label Description Also known as
English
Efficient algorithms for interval graphs and circular-arc graphs
scientific article

    Statements

    Efficient algorithms for interval graphs and circular-arc graphs (English)
    0 references
    0 references
    1982
    0 references
    0 references
    0 references
    0 references
    0 references
    maximum independent set
    0 references
    minimum covering by disjoint completely connected sets of cliques
    0 references
    maximum clique
    0 references