Optimal enclosing regions in planar graphs
- 1 January 1989
- Vol. 19 (1) , 79-94
- https://doi.org/10.1002/net.3230190107
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Convexity and the Steiner tree problemNetworks, 1988
- On the Complexity of Covering Vertices by Faces in a Planar GraphSIAM Journal on Computing, 1988
- Send-and-Split Method for Minimum-Concave-Cost Network FlowsMathematics of Operations Research, 1987
- Dividing a Graph into Triconnected ComponentsSIAM Journal on Computing, 1973