A simple algorithm for finding a cycle of length greater than three and without diagonals (Q1147514): Difference between revisions

@@ Property / author @@
-Miroslaw Truszczynski
@@ Property / author: Miroslaw Truszczynski / rank @@
-Normal rank
@@ Property / author @@
+Miroslaw Truszczynski
@@ Property / author: Miroslaw Truszczynski / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
+Normal rank
@@ Property / cites work @@
+Finding a Minimum Circuit in a Graph
@@ Property / cites work: Finding a Minimum Circuit in a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Information storage and retrieval - mathematical foundations. II: Combinatorial problems
+Normal rank
@@ Property / cites work @@
+Triangulated graphs and the elimination process
@@ Property / cites work: Triangulated graphs and the elimination process / rank @@
+Normal rank