Finding Paths and Cycles in Graphs

Simple item page
dc.creatorGubin, Sergey
dc.date2007-09-07
dc.date.accessioned2026-07-07T08:28:08Z
dc.date.available2026-07-07T08:28:08Z
dc.descriptionA polynomial time algorithm which detects all paths and cycles of all lengths in form of vertex pairs (start, finish).
dc.description11 pages
dc.identifierhttps://arxiv.org/abs/0709.0974
dc.identifierhttp://arxiv.org/abs/0709.0974
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/137508
dc.subjectDiscrete Mathematics
dc.subjectComputational Complexity
dc.subjectData Structures and Algorithms
dc.subjectCombinatorics
dc.subjectG.2.2; G.2.0; F.1.3; F.1.0
dc.titleFinding Paths and Cycles in Graphs
dc.typetext

Files

Collections

arXiv