On the complexity of partitioning graphs for arc-flags (Q2838234)
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: On the complexity of partitioning graphs for arc-flags |
scientific article; zbMATH DE number 6185336
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of partitioning graphs for arc-flags |
scientific article; zbMATH DE number 6185336 |
Statements
9 July 2013
0 references
precomputation of auxiliary data
0 references
arc-flags algorithm
0 references
partition of a graph
0 references
search-space size
0 references
shortest path queries
0 references
optimal partitions
0 references
approximation algorithms
0 references
cycles
0 references
trees
0 references
On the complexity of partitioning graphs for arc-flags (English)
0 references
