Finding Paths and Cycles in Graphs
Discrete Mathematics
2007-09-10 v1 Computational Complexity
Data Structures and Algorithms
Combinatorics
Abstract
A polynomial time algorithm which detects all paths and cycles of all lengths in form of vertex pairs (start, finish).
Keywords
Cite
@article{arxiv.0709.0974,
title = {Finding Paths and Cycles in Graphs},
author = {Sergey Gubin},
journal= {arXiv preprint arXiv:0709.0974},
year = {2007}
}
Comments
11 pages