论文信息 - LINEAR SPHERICITY TESTING OF 3-CONNECTED SINGLE SOURCE DIGRAPHS

LINEAR SPHERICITY TESTING OF 3-CONNECTED SINGLE SOURCE DIGRAPHS

It has been proved that sphericity testing for digraphs is an NP-complete problem. Here, we investigate sphericity of 3- connected single source digraphs. We provide a new combinatorial characterization of sphericity and give a linear time algorithm for sphericity testing. Our algorithm tests whether a 3-connected single source digraph with n vertices is spherical in O(n) time.

Ardeshir Dolati

[1] Ardeshir Dolati,et al. On the sphericity testing of single source digraphs , 2008, Discret. Math..

[2] Kellogg S. Booth,et al. Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[3] S. Gill Williamson,et al. Depth-First Search and Kuratowski Subgraphs , 1984, JACM.

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

[5] Carlo Mannino,et al. Optimal Upward Planarity Testing of Single-Source Digraphs , 1993, ESA.

[6] H. Whitney. A Set of Topological Invariants for Graphs , 1933 .

[7] Andrzej Kisielewicz,et al. The Complexity of Upward Drawings on Spheres , 1997 .

[8] Ardeshir Dolati,et al. On the Upward Embedding on the Torus , 2008 .

[9] Jonathan L. Gross,et al. Topological Graph Theory , 1987, Handbook of Graph Theory.

[10] Norishige Chiba,et al. A Linear Algorithm for Embedding Planar Graphs Using PQ-Trees , 1985, J. Comput. Syst. Sci..

[11] S. Mehdi Hashemi. Digraph embedding , 2001, Discret. Math..

[12] Carsten Thomassen,et al. Graphs on Surfaces , 2001, Johns Hopkins series in the mathematical sciences.

[13] Bojan Mohar,et al. A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface , 1999, SIAM J. Discret. Math..