A simple algorithm for finding a cycle of length greater than three and without diagonals

DOI10.1007/BF02243441zbMath0449.68026OpenAlexW2922630147MaRDI QIDQ1147514

Miroslaw Truszczynski

Publication date: 1981

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02243441

zbMATH Keywords

algorithmcycle

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Related Items (1)

Combinatorial analysis (nonnegative matrices, algorithmic problems)

Cites Work

• Unnamed Item
• Information storage and retrieval - mathematical foundations. II: Combinatorial problems
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Triangulated graphs and the elimination process
• Finding a Minimum Circuit in a Graph

This page was built for publication: A simple algorithm for finding a cycle of length greater than three and without diagonals