Space efficient algorithms for some graph theoretical problems (Q1160148)
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 3749061
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Space efficient algorithms for some graph theoretical problems |
scientific article; zbMATH DE number 3749061 |
Statements
Space efficient algorithms for some graph theoretical problems (English)
0 references
1982
0 references
deterministic algorithms
0 references
planarity testing
0 references
producing a plane embedding
0 references
minimum cost spanning trees
0 references
