Finding Paths and Cycles in Graphs
Sergey Gubin
TL;DR
This paper presents a polynomial time algorithm capable of detecting all paths and cycles of any length in a graph, represented as vertex pairs, enhancing graph analysis efficiency.
Contribution
Introduces a novel polynomial time algorithm for comprehensive detection of all paths and cycles in graphs, improving over previous methods.
Findings
Efficient detection of all paths and cycles in polynomial time
Algorithm handles all lengths of paths and cycles
Potential applications in network analysis and graph theory
Abstract
A polynomial time algorithm which detects all paths and cycles of all lengths in form of vertex pairs (start, finish).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph Theory and Algorithms · Complexity and Algorithms in Graphs