Cost tradeoffs in graph embeddings, with applications
- 1 January 1981
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- On similarity and duality of computation (I)Information and Control, 1984
- AlternationJournal of the ACM, 1981
- Encoding Data Structures in TreesJournal of the ACM, 1979
- A Separator Theorem for Planar GraphsSIAM Journal on Applied Mathematics, 1979
- On Small Universal Data Structures and Related Combinatorial Problems.Published by Defense Technical Information Center (DTIC) ,1978
- Applications of a planar separator theoremPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1977
- A Best Possible Bound for The Weighted Path Length of Binary Search TreesSIAM Journal on Computing, 1977
- Space and Time Hierarchies for Classes of Control Structures and Data StructuresJournal of the ACM, 1976
- The recognition problem for the set of perfect squaresPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1966
- Memory bounds for recognition of context-free and context-sensitive languagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1965