Finding maximum cliques in arbitrary and in special graphs (Q807639): Difference between revisions

@@ Property / describes a project that uses @@
+Algorithm 457
@@ Property / describes a project that uses: Algorithm 457 / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+TABARIS
@@ Property / describes a project that uses: TABARIS / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Q5668821
@@ Property / cites work: Q5668821 / rank @@
+Normal rank
@@ Property / cites work @@
+New methods to color the vertices of a graph
@@ Property / cites work: New methods to color the vertices of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4770975
@@ Property / cites work: Q4770975 / rank @@
+Normal rank
@@ Property / cites work @@
+Incidence matrices and interval graphs
@@ Property / cites work: Incidence matrices and interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-completeness column: an ongoing guide
@@ Property / cites work: The NP-completeness column: an ongoing guide / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-completeness column: An ongoing guide
@@ Property / cites work: The NP-completeness column: An ongoing guide / rank @@
+Normal rank
@@ Property / cites work @@
+Steiner trees, partial 2–trees, and minimum IFI networks
+Normal rank
@@ Property / cites work @@
+Q5752591
@@ Property / cites work: Q5752591 / rank @@
+Normal rank
@@ Property / cites work @@
+An Analysis of Some Graph Theoretical Cluster Techniques
+Normal rank
@@ Property / cites work @@
+A node covering algorithm
@@ Property / cites work: A node covering algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a Maximum Clique in an Arbitrary Graph
@@ Property / cites work: Finding a Maximum Clique in an Arbitrary Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm 457: finding all cliques of an undirected graph
+Normal rank
@@ Property / cites work @@
+TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph
+Normal rank
@@ Property / cites work @@
+Clique detection for nondirected graphs: Two new algorithms
+Normal rank
@@ Property / cites work @@
+A new backtracking algorithm for generating the family of maximal independent sets of a graph
+Normal rank
@@ Property / cites work @@
+Determining the number of internal stability of a graph
+Normal rank
@@ Property / cites work @@
+Vertex packings: Structural properties and algorithms
+Normal rank
@@ Property / cites work @@
+Finding a Maximum Independent Set
@@ Property / cites work: Finding a Maximum Independent Set / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Recognition Algorithm for Cographs
@@ Property / cites work: A Linear Recognition Algorithm for Cographs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
+Normal rank
@@ Property / cites work @@
+Algorithms for a maximum clique and a maximum independent set of a circle graph
+Normal rank
@@ Property / cites work @@
+Algorithms on circular-arc graphs
@@ Property / cites work: Algorithms on circular-arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Stability in circular arc graphs
@@ Property / cites work: Stability in circular arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for interval graphs and circular-arc graphs
+Normal rank
@@ Property / cites work @@
+A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles
+Normal rank
@@ Property / cites work @@
+Q5184940
@@ Property / cites work: Q5184940 / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for finding maximum cliques of an overlap graph
+Normal rank
@@ Property / cites work @@
+On maximal independent sets of vertices in claw-free graphs
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Vertex Elimination on Graphs
+Normal rank
@@ Property / cites work @@
+Finding maximum cliques in circle graphs
@@ Property / cites work: Finding maximum cliques in circle graphs / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf02257777
+Normal rank
@@ Property / OpenAlex ID @@
+W1512959368
@@ Property / OpenAlex ID: W1512959368 / rank @@
+Normal rank