Author:
Easwarakumar K. S.,Krishnan S. V.,Rangan C. Pandu,Seshadri S.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference15 articles.
1. J. Cheriyan and S. N. Maheshwari. Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs.J. Algorithms, 9:507–537, 1988.
2. J. Edmonds. A combinatorial representation for polyhedral surfaces.Notices Amer. Math. Soc., 7:646, 1960.
3. H. Gazit. Optimal EREW parallel algorithms for connectivity, ear decomposition andst-numbering of planar graphs. Manuscript, Department of Computer Science, Duke University, Durham, NC 27706.
4. Lecture Notes on Computer Science, Vol. 319;T. Hagerup,1988
5. D. Harel and R. E. Tarjan. Fast algorithm for finding nearest common ancestors.SIAM J. Comput., 13:338–355, 1984.