Splitting number is NP-complete

Discrete Applied Mathematics

Volumn 108, Issue 1-2, 2001, Pages 65-83

  Faria, L ^a   De Figueiredo, C M H ^b   Mendonca C F X ^c  

^a STATE UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^b FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^c UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

Computational complexity; Nonplanarity parameters; Topological graph theory

Indexed keywords

EID: 0142224799     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00220-1     Document Type: Article

References (12)

1. S.A. Cook, The complexity of theorem-proving procedures, Proceedings of the Third ACM Symposium on Theory of Computing, New York, 1971, pp. 151-158.
2. P. Eades, C.F.X. Mendonça, Heuristics for planarization by vertex splitting, Proceedings of the ALCOM International Workshop on Graph Drawing, GD'93, 1993, pp. 83-85.
3. P. Eades, C.F.X. Mendonça, Vertex splitting and tension-free layout, Proceedings of the GD'95, Lecture Notes in Computer Science, Vol. 1027, 1996, pp. 202-211.
4. L. Faria, C.M.H. Figueiredo, C.F.X. Mendonça, The splitting number of the 4 -cube, Proceedings of the LATIN'98, Lecture Notes in Computer Science, Vol. 1380, 1998, pp. 141-150.
5. Hartfield N., Jackson B., Ringel G. The splitting number of the complete graph. Graphs Combin. 1:1985;311-329.
6. Hopcroft J.E., Tarjan R.E. Efficient planarity testing. J. ACM. 21:1974;549-568.
7. Jackson B., Ringel G. The splitting number of complete bipartite graphs. Arch. Math. 42:1984;178-184.
8. Kuratowski K. Sur le problème des courbes gauches en topologie. Fund. Math. 15:1930;271-283.
9. A. Liebers, Planarizing graphs - a survey and annotated bibliography Technical Report, University of Konstanz, 1999. Available at ftp: // ftp.fmi.uni-konstanz.de / pub / preprints / 1996 / preprint-012-02.ps.Z.
10. Liu P.C., Geldmacher R.C. On the deletion of nonplanar edges of a graph. Congr. Numer. 24:1979;727-738.
11. C.F.X. Mendonça, A layout system for information system diagrams, Ph.D. Thesis, University of Queensland, Australia, 1994.
12. Yannakakis M. Edge-deletion problems. SIAM J. Comput. 10:1981;297-309.