Fast Parallel Algorithms for All-Sources Lexicographic Search and Path-Algebra Problems (Q4840217)
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 777605
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast Parallel Algorithms for All-Sources Lexicographic Search and Path-Algebra Problems |
scientific article; zbMATH DE number 777605 |
Statements
Fast Parallel Algorithms for All-Sources Lexicographic Search and Path-Algebra Problems (English)
0 references
24 July 1995
0 references
greedy search problems
0 references
lexicographic topological-first search
0 references
lexicographic depth-first search
0 references
lexicographic breadth-first search
0 references
directed graphs
0 references
0.9022098183631896
0 references
0.9022098183631896
0 references
0.8142189979553223
0 references
0.7902584671974182
0 references
