A generalization of chordal graphs and the maximum clique problem (Q287036): Difference between revisions

@@ 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 @@
+Incidence matrices and interval graphs
@@ Property / cites work: Incidence matrices and interval graphs / 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 @@
+Weakly triangulated graphs
@@ Property / cites work: Weakly triangulated graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Triangulated graphs and the elimination process
@@ Property / cites work: Triangulated graphs and the elimination process / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Vertex Elimination on Graphs
+Normal rank
@@ Property / cites work @@
+Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
+Normal rank
@@ Property / cites work @@
+Edge‐maximal triangulated subgraphs and heuristics for the maximum clique problem
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0020-0190(97)00044-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2054972273
@@ Property / OpenAlex ID: W2054972273 / rank @@
+Normal rank