Universidad de Cantabria

Researchers portal

Portal del personal investigador

EN / ES
Search

Searching. Please wait…

Inicio Portal del Investigador > en > Publications > publication-detail

Detalle_Publicacion

Connectedness of finite distance graphs

Share on Mendeley
Share on Researchgate
Share on Facebook
Share on Twitter
Send by e-mail
Share on LinkedIn
Share by Whatsapp

Abstract: We describe a polynomial-time algorithm for deciding whether a given distance graph with a finite number ofvertices is connected. This problem was conjectured to be NP-hard in Draque Penso et al.

 Authorship: Gómez-Pérez D., Gutierrez J., Ibeas A.,

 Fuente: Networks, 2012, 60(3), 204-209

 Publisher: Wiley

 Publication date: 01/10/2012

 No. of pages: 6

 Publication type: Article

 DOI: 10.1002/net.21465

 ISSN: 0028-3045,1097-0037

 Publication Url: https://doi.org/10.1002/net.21465

Consult in Scopus

Consult in Scopus

Authorship

DOMINGO GOMEZ PEREZ

JAIME GUTIERREZ GUTIERREZ

ALVAR JESUS IBEAS MARTIN

Back