Worst-case ration for planar graphs and the method of induction on faces
- 1 October 1981
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 358-363
- https://doi.org/10.1109/sfcs.1981.55
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- New Algorithms for Bin PackingJournal of the ACM, 1980
- Applications of a planar separator theoremPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1977
- Resource constrained scheduling as generalized bin packingJournal of Combinatorial Theory, Series A, 1976
- Algorithmic Aspects of Vertex Elimination on GraphsSIAM Journal on Computing, 1976
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- Approximation algorithms for combinatorial problemsJournal of Computer and System Sciences, 1974
- Worst-Case Performance Bounds for Simple One-Dimensional Packing AlgorithmsSIAM Journal on Computing, 1974
- A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONSPublished by Elsevier ,1972
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965