Dynamic maintenance of planar digraphs, with applications
- 1 June 1990
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 5 (1-4) , 509-527
- https://doi.org/10.1007/bf01840401
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Algorithms for plane representations of acyclic digraphsTheoretical Computer Science, 1988
- A linear algorithm to find a rectangular dual of a planar triangulated graphAlgorithmica, 1988
- A dynamic data structure for planar graph embeddingPublished by Springer Nature ,1988
- Maintenance of transitive closures and transitive reductions of graphsLecture Notes in Computer Science, 1988
- Rectilinear planar layouts and bipolar orientations of planar graphsDiscrete & Computational Geometry, 1986
- Optimal Point Location in a Monotone SubdivisionSIAM Journal on Computing, 1986
- A linear algorithm for embedding planar graphs using PQ-treesJournal of Computer and System Sciences, 1985
- Computational GeometryPublished by Springer Nature ,1985
- A graph-planarization algorithm and its application to random graphsPublished by Springer Nature ,1981
- Planar LatticesCanadian Journal of Mathematics, 1975