I/O-efficient algorithms on near-planar graphs (Q5891342)
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: I/O-efficient algorithms on near-planar graphs |
scientific article; zbMATH DE number 6234158
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | I/O-efficient algorithms on near-planar graphs |
scientific article; zbMATH DE number 6234158 |
Statements
28 November 2013
0 references
I/O-efficient algorithms
0 references
basic graph problems
0 references
sparse directed graphs
0 references
computational complexity
0 references
I/O-efficient algorithms on near-planar graphs (English)
0 references
