Planar graph augmentation problems
- 17 June 2005
- book chapter
- Published by Springer Nature
- p. 286-298
- https://doi.org/10.1007/bfb0028270
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A fast algorithm for optimally increasing the edge-connectivityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Augmenting graphs to meet edge-connectivity requirementsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Incremental planarity testingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Approximation Algorithms for Several Graph Augmentation ProblemsSIAM Journal on Computing, 1981
- Another look at the degree constrained subgraph problemInformation Processing Letters, 1981
- Smallest Augmentations to Biconnect a GraphSIAM Journal on Computing, 1977
- Augmentation ProblemsSIAM Journal on Computing, 1976
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- Convex Representations of GraphsProceedings of the London Mathematical Society, 1960