Han, Xiaofeng; Kelsen, Pierre; Ramachandran, Vijaya; Tarjan, Robert Computing minimal spanning subgraphs in linear time. (English) Zbl 0841.05084 SIAM J. Comput. 24, No. 6, 1332-1358 (1995). Reviewer: K.R.Parthasarathy (Narayanapuram) MSC: 05C85 05C40 68Q25 68R10 PDFBibTeX XMLCite \textit{X. Han} et al., SIAM J. Comput. 24, No. 6, 1332--1358 (1995; Zbl 0841.05084) Full Text: DOI
Cai, Jiazhen; Han, Xiaofeng; Tarjan, Robert E. An \(O(m\log n)\)-time algorithm for the maximal planar subgraph problem. (English) Zbl 0799.68151 SIAM J. Comput. 22, No. 6, 1142-1162 (1993). MSC: 68R10 68Q25 94C15 05C10 PDFBibTeX XMLCite \textit{J. Cai} et al., SIAM J. Comput. 22, No. 6, 1142--1162 (1993; Zbl 0799.68151) Full Text: DOI
Han, Xiaofeng; Kelsen, Pierre; Ramachandran, Vijaya; Tarjan, Robert Computing minimal spanning subgraphs in linear time. (English) Zbl 0829.68093 Frederickson, Greg (ed.), Proceedings of the third annual ACM-SIAM symposium on discrete algorithms, held January 27-29, 1992, in Orlando, FL, USA. Philadelphia, PA: SIAM. 146-156 (1992). MSC: 68R10 68Q25 PDFBibTeX XMLCite \textit{X. Han} et al., in: Proceedings of the third annual ACM-SIAM symposium on discrete algorithms, SODA '92, held January 27--29, 1992, in Orlando, FL, USA. Philadelphia, PA: SIAM; New York, NY: ACM. 146--156 (1992; Zbl 0829.68093)