\(O(1)\) query time algorithm for all pairs shortest distances on permutation graphs (Q868392)
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: \(O(1)\) query time algorithm for all pairs shortest distances on permutation graphs |
scientific article; zbMATH DE number 5130475
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(O(1)\) query time algorithm for all pairs shortest distances on permutation graphs |
scientific article; zbMATH DE number 5130475 |
Statements
\(O(1)\) query time algorithm for all pairs shortest distances on permutation graphs (English)
0 references
2 March 2007
0 references
all pairs shortest paths
0 references
bipartite permutation graph
0 references
permutation graph
0 references
unit interval graph
0 references
