Author:
Chalermsook Parinya,Schmid Andreas
Publisher
Springer International Publishing
Reference13 articles.
1. Cai, J., Han, X., Tarjan, R.E.: An $$O(m \log n)$$ -time algorithm for the maximal planar subgraph problem. SIAM J. Comput. 22(6), 1142–1162 (1993)
2. Călinescu, G., Fernandes, C.G., Finkler, U., Karloff, H.: A better approximation algorithm for finding planar subgraphs. J. Algorithms 27(2), 269–302 (1998)
3. Călinescu, G., Fernandes, C.G., Karloff, H.J., Zelikovsky, A.: A new approximation algorithm for finding heavy planar subgraphs. Algorithmica 36(2), 179–205 (2003)
4. Călinescu, G., Fernandes, C.G., Kaul, H., Zelikovsky, A.: Maximum series-parallel subgraph. Algorithmica 63(1–2), 137–157 (2012)
5. Chiba, T., Nishioka, I., Shirakawa, I.: An algorithm of maximal planarization of graphs. In: Proceedings of IEEE Symposium on Circuits and Systems, pp. 649–652 (1979)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献