Solving the all-pairs-shortest-length problem on chordal bipartite graphs (Q294620)
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: Solving the all-pairs-shortest-length problem on chordal bipartite graphs |
scientific article; zbMATH DE number 6594021
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the all-pairs-shortest-length problem on chordal bipartite graphs |
scientific article; zbMATH DE number 6594021 |
Statements
Solving the all-pairs-shortest-length problem on chordal bipartite graphs (English)
0 references
16 June 2016
0 references
shortest paths
0 references
chordal bipartite graphs
0 references
strongly chordal graphs
0 references
graph algorithms
0 references
0.868708610534668
0 references
0.8685129284858704
0 references
0.8629711866378784
0 references
0.7988069653511047
0 references
