The Complexity of Finding Paths in Graphs with Bounded Independence Number (Q5317191)
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 2205887
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.91159487
0 references
0.91159487
0 references
0.90554094
0 references
0.9036715
0 references
0.8980068
0 references
0.8909064
0 references
0.8882943
0 references
0.8882943
0 references
0.8881292
0 references
