An $$O(n^{\epsilon })$$ Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs (Q3459899)
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: An $$O(n^{\epsilon })$$ Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An $$O(n^{\epsilon })$$ Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs |
scientific article |
Statements
An $$O(n^{\epsilon })$$ Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs (English)
0 references
11 January 2016
0 references
0 references
0.9563771
0 references
0.88642704
0 references
0.88151926
0 references
0.8763052
0 references
0.8668803
0 references
0.8638532
0 references
