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. (C) 2012 Wiley Periodicals, Inc. NETWORKS, 2012
机构:
Univ Paris 11, CNRS, Rech Informat Lab, UMR 8623, F-91405 Orsay, FranceUniv Paris 11, CNRS, Rech Informat Lab, UMR 8623, F-91405 Orsay, France
Yang, Weihua
Lai, Hongjian
论文数: 0引用数: 0
h-index: 0
机构:
W Virginia Univ, Dept Math, Morgantown, WV 26506 USA
Xinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Xinjiang, Peoples R ChinaUniv Paris 11, CNRS, Rech Informat Lab, UMR 8623, F-91405 Orsay, France
Lai, Hongjian
Li, Hao
论文数: 0引用数: 0
h-index: 0
机构:
Univ Paris 11, CNRS, Rech Informat Lab, UMR 8623, F-91405 Orsay, FranceUniv Paris 11, CNRS, Rech Informat Lab, UMR 8623, F-91405 Orsay, France
Li, Hao
Guo, Xiaofeng
论文数: 0引用数: 0
h-index: 0
机构:
Xiamen Univ, Sch Math Sci, Xiamen 361005, Fujian, Peoples R ChinaUniv Paris 11, CNRS, Rech Informat Lab, UMR 8623, F-91405 Orsay, France
机构:
CRMEF, Rabat-Salé-Kénitra Avenue Allal El Fassi, Bab Madinat Al Irfane, RabatCRMEF, Rabat-Salé-Kénitra Avenue Allal El Fassi, Bab Madinat Al Irfane, Rabat
Chaira K.
Dovgoshey O.
论文数: 0引用数: 0
h-index: 0
机构:
Institute of Applied Mathematics and Mechanics of the NAS of Ukraine, Sloviansk
Department of Mathematics and Statistics University of Turku, TurkuCRMEF, Rabat-Salé-Kénitra Avenue Allal El Fassi, Bab Madinat Al Irfane, Rabat