Matching and spanning in certain planar graphs

[1]  Silvio Micali,et al.  An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[2]  Shimon Even,et al.  Graph Algorithms , 1979 .

[3]  Ellis Horowitz,et al.  Fundamentals of Computer Algorithms , 1978 .

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  David S. Johnson,et al.  The Planar Hamiltonian Circuit Problem is NP-Complete , 1976, SIAM J. Comput..

[6]  Shimon Even,et al.  An O (N2.5) algorithm for maximum matching in general graphs , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[7]  Robert E. Tarjan,et al.  Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.

[8]  Sheila A. Greibach,et al.  A Two-Dimensional Generating System Modeling Growth by Binary Cell Division (Preliminary Report) , 1974, SWAT.

[9]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[10]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[11]  Jeffrey D. Ullman,et al.  Set Merging Algorithms , 1973, SIAM J. Comput..

[12]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[13]  H. Gabow.  An efficient implementation of Edmonds'' maximum matching algorithm. , 1972 .

[14]  J. Wright.  A decomposition theorem , 1970 .

[15]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics - Journal Canadien de Mathematiques.

[16]  R. P. Dilworth,et al.  A DECOMPOSITION THEOREM FOR PARTIALLY ORDERED SETS , 1950 .