Optimal greedy algorithms for indifference graphs (Q2365550)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 222308
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal greedy algorithms for indifference graphs |
scientific article; zbMATH DE number 222308 |
Statements
Optimal greedy algorithms for indifference graphs (English)
0 references
29 June 1993
0 references
indifference
0 references
greedy algorithms
0 references
coloring
0 references
shortest path
0 references
maximum matching
0 references
center
0 references
Hamiltonian path
0 references
0 references
0.6910631060600281
0 references
0.6868376731872559
0 references
0.676358163356781
0 references
