Algorithms for finding disjoint path covers in unit interval graphs (Q266951)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithms for finding disjoint path covers in unit interval graphs |
scientific article; zbMATH DE number 6566338
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for finding disjoint path covers in unit interval graphs |
scientific article; zbMATH DE number 6566338 |
Statements
Algorithms for finding disjoint path covers in unit interval graphs (English)
0 references
7 April 2016
0 references
disjoint path
0 references
path cover
0 references
path partition
0 references
proper interval graph
0 references
graph algorithm
0 references
0 references
0 references
0.9138379
0 references
0.9047914
0 references
0.8977366
0 references
0.8957401
0 references
0.8922313
0 references
