Algorithms for Finding Diameter Cycles of Biconnected Graphs

In this paper, we first coin a new graph theoretic problem called the diameter cycle problem with numerous applications. A longest cycle in a graph G = (V, E) is referred to as a diameter cycle of G iff the distance in G of every vertex on the cycle to the rest of the on-cycle vertices is maximal. W...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Mehmet Hakan Karaata
Formato: article
Lenguaje:EN
Publicado: University of Zagreb Faculty of Electrical Engineering and Computing 2020
Materias:
Acceso en línea:https://doaj.org/article/e4ed12fe63cb462f966846a5af76529b
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!