Matching and spanning in certain planar graphs
- 1 December 1983
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 16 (1) , 159-183
- https://doi.org/10.1007/bf01744575
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- An O(v|v| c |E|) algoithm for finding maximum matching in general graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- The Planar Hamiltonian Circuit Problem is NP-CompleteSIAM Journal on Computing, 1976
- An O (N2.5) algorithm for maximum matching in general graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1975
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975
- Efficient Planarity TestingJournal of the ACM, 1974
- A two-dimensional generating system modeling growth by binary cell divisionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1974
- Set Merging AlgorithmsSIAM Journal on Computing, 1973
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965
- A Decomposition Theorem for Partially Ordered SetsAnnals of Mathematics, 1950