The Complexity of Finding Paths in Graphs with Bounded Independence Number (Q5317191)
From MaRDI portal
scientific article; zbMATH DE number 2205887
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Complexity of Finding Paths in Graphs with Bounded Independence Number |
scientific article; zbMATH DE number 2205887 |
Statements
The Complexity of Finding Paths in Graphs with Bounded Independence Number (English)
0 references
16 September 2005
0 references
reachability
0 references
connectivity
0 references
shortest paths
0 references
distance in graphs
0 references
logarithmic space
0 references
tournaments
0 references
first-order definability
0 references
polynomial hierarchy
0 references
completeness
0 references
approximation algorithms
0 references
succinct representations
0 references
