Issues in the study of graph embeddings
- 1 January 1981
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 150-176
- https://doi.org/10.1007/3-540-10291-4_12
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- A Separator Theorem for Planar GraphsSIAM Journal on Applied Mathematics, 1979
- Complexity Results for Bandwidth MinimizationSIAM Journal on Applied Mathematics, 1978
- Preserving average proximity in arraysCommunications of the ACM, 1978
- Data encodings and their costsActa Informatica, 1978
- Space and Time Hierarchies for Classes of Control Structures and Data StructuresJournal of the ACM, 1976
- The NP-Completeness of the bandwidth minimization problemComputing, 1976
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- Preserving Proximity in ArraysSIAM Journal on Computing, 1975
- The recognition problem for the set of perfect squares7th Annual Symposium on Switching and Automata Theory (swat 1966), 1966
- Optimal numberings and isoperimetric problems on graphsJournal of Combinatorial Theory, 1966