Hierarchically specified unit disk graphs
- 15 March 1997
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 174 (1-2) , 23-65
- https://doi.org/10.1016/s0304-3975(96)00008-4
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Minimum Cost Paths in Periodic GraphsSIAM Journal on Computing, 1995
- The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problemsJournal of Computer and System Sciences, 1992
- Unit disk graphsDiscrete Mathematics, 1990
- Hierarchical planarity testing algorithmsJournal of the ACM, 1989
- Efficient Solution of Connectivity Problems on Hierarchically Defined GraphsSIAM Journal on Computing, 1988
- Efficient algorithms for finding minimum spanning forests of hierarchically defined graphsJournal of Algorithms, 1987
- Efficient solutions of hierarchical systems of linear equationsComputing, 1987
- Approximation schemes for covering and packing problems in image processing and VLSIJournal of the ACM, 1985
- Succinct representations of graphsInformation and Control, 1983
- Optimal packing and covering in the plane are NP-completeInformation Processing Letters, 1981