An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications (Q1900895)
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 809153
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications |
scientific article; zbMATH DE number 809153 |
Statements
An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications (English)
0 references
4 February 1996
0 references
shortest paths
0 references
interval graphs
0 references
circular-arc graph
0 references
circle-cover problem
0 references
0 references
0.8573766350746155
0 references
0.8317461013793945
0 references
0.8207626342773438
0 references
0.8138672113418579
0 references
0.8081886172294617
0 references
