Clique detection for nondirected graphs: Two new algorithms (Q1143177): Difference between revisions

@@ Property / cites work @@
+Q5541377
@@ Property / cites work: Q5541377 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm 457: finding all cliques of an undirected graph
+Normal rank
@@ Property / cites work @@
+An algorithm for the chromatic number of a graph
@@ Property / cites work: An algorithm for the chromatic number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum internally stable sets of a graph
@@ Property / cites work: Maximum internally stable sets of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Clique detection in directed graphs: A new algorithm
+Normal rank
@@ Property / cites work @@
+Q3261003
@@ Property / cites work: Q3261003 / rank @@
+Normal rank
@@ Property / cites work @@
+On cliques in graphs
@@ Property / cites work: On cliques in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4105691
@@ Property / cites work: Q4105691 / rank @@
+Normal rank