Finding Paths and Cycles in Graphs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

A polynomial time algorithm which detects all paths and cycles of all lengths in form of vertex pairs (start, finish).
11 pages

Keywords

Discrete Mathematics, Computational Complexity, Data Structures and Algorithms, Combinatorics, G.2.2; G.2.0; F.1.3; F.1.0

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/137508

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0709.0974
 http://arxiv.org/abs/0709.0974

Collections

arXiv