Maintaining longest paths incrementally (Q816679)
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: Maintaining longest paths incrementally |
scientific article; zbMATH DE number 5009058
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maintaining longest paths incrementally |
scientific article; zbMATH DE number 5009058 |
Statements
Maintaining longest paths incrementally (English)
0 references
23 February 2006
0 references
incremental
0 references
longest path
0 references
heaviest path
0 references
bounded computation
0 references
graph
0 references
constraint
0 references
local search
0 references
scheduling
0 references
0 references
0 references
0 references
0.88058984
0 references
0.85645616
0 references
0 references
0.8446576
0 references
0.84401256
0 references
0.83517116
0 references
0 references
0.8329476
0 references
