论文信息 - Connectedness of finite distance graphs

Connectedness of finite distance graphs

We describe a polynomial-time algorithm for deciding whether a given distance graph with a finite number of vertices is connected. This problem was conjectured to be NP-hard in Draque Penso et al. © 2012 Wiley Periodicals, Inc. NETWORKS, 2012 © 2012 Wiley Periodicals, Inc.

Domingo Gómez-Pérez | Jaime Gutierrez | Álvar Ibeas

[1] Ralph Tindell,et al. Circulants and their connectivities , 1984, J. Graph Theory.

[2] Frank K. Hwang,et al. A complementary survey on double-loop networks , 2001, Theor. Comput. Sci..

[3] Zsolt Tuza,et al. Hamiltonian properties of Toeplitz graphs , 1996, Discret. Math..

[4] Chak-Kuen Wong,et al. A Combinatorial Problem Related to Multimodule Memory Organizations , 1974, JACM.

[5] Clemens Heuberger. On hamiltonian Toeplitz graphs , 2002, Discret. Math..

[6] Xuding Zhu,et al. The chromatic numbers of distance graphs , 1997, Discret. Math..

[7] Mateo Valero,et al. Discrete Optimization Problem in Local Networks and Data Alignment , 1987, IEEE Transactions on Computers.

[8] Francisco Santos,et al. Triple-loop networks with arbitrarily many minimum distance diagrams , 2009, Discret. Math..

[9] Domingo Gómez-Pérez,et al. Cayley Digraphs of Finite Abelian Groups and Monomial Ideals , 2007, SIAM J. Discret. Math..

[10] Arnfried Kemnitz,et al. Coloring of integer distance graphs , 1998, Discret. Math..

[11] Jayme Luiz Szwarcfiter,et al. Connectivity and diameter in distance graphs , 2011, Networks.

[12] Paul Erdös,et al. Colouring the real line , 1985, J. Comb. Theory B.

[13] D. Frank Hsu,et al. Distributed Loop Computer Networks: A Survey , 1995, J. Parallel Distributed Comput..