Deferred-query: An efficient approach for some problems on interval graphs (Q4262690)
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: Deferred-query: An efficient approach for some problems on interval graphs |
scientific article; zbMATH DE number 1340880
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deferred-query: An efficient approach for some problems on interval graphs |
scientific article; zbMATH DE number 1340880 |
Statements
22 September 1999
0 references
interval graphs
0 references
graph algorithms
0 references
domatic partition
0 references
Hamiltonian path
0 references
Hamiltonian circuit
0 references
optimal path cover
0 references
maximum matching
0 references
0 references
Deferred-query: An efficient approach for some problems on interval graphs (English)
0 references
0.9274778
0 references
0.8722135
0 references
0.86378187
0 references
0.8622742
0 references
0.85943204
0 references
0.85672104
0 references
