A simple algorithm for finding a cycle of length greater than three and without diagonals (Q1147514): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q286082 |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Miroslaw Truszczynski / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4091421 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding a Minimum Circuit in a Graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Information storage and retrieval - mathematical foundations. II: Combinatorial problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Triangulated graphs and the elimination process / rank | |||
Normal rank |
Revision as of 11:04, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A simple algorithm for finding a cycle of length greater than three and without diagonals |
scientific article |
Statements
A simple algorithm for finding a cycle of length greater than three and without diagonals (English)
0 references
1981
0 references
algorithm
0 references
cycle
0 references
0 references
0 references