Listing all potential maximal cliques of a graph (Q1605302): Difference between revisions

@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+An algebraic theory of graph reduction
@@ Property / cites work: An algebraic theory of graph reduction / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time algorithms for NP-hard problems restricted to partial k- trees
+Normal rank
@@ Property / cites work @@
+Q4291429
@@ Property / cites work: Q4291429 / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Q4699283
@@ Property / cites work: Q4699283 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
+Normal rank
@@ Property / cites work @@
+Q4250226
@@ Property / cites work: Q4250226 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252036
@@ Property / cites work: Q4252036 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4251051
@@ Property / cites work: Q4251051 / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
+Normal rank
@@ Property / cites work @@
+Monadic second-order evaluations on tree-decomposable graphs
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic algorithms for graphs of bounded treewidth
+Normal rank
@@ Property / cites work @@
+Inferring Evolutionary History From DNA Sequences
@@ Property / cites work: Inferring Evolutionary History From DNA Sequences / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth of Chordal Bipartite Graphs
@@ Property / cites work: Treewidth of Chordal Bipartite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Listing all Minimal Separators of a Graph
@@ Property / cites work: Listing all Minimal Separators of a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the bandwidth for asteroidal triple-free graphs
+Normal rank
@@ Property / cites work @@
+On treewidth and minimum fill-in of asteroidal triple-free graphs
+Normal rank
@@ Property / cites work @@
+Minimum Fill-in on Circle and Circular-Arc Graphs
@@ Property / cites work: Minimum Fill-in on Circle and Circular-Arc Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
+Normal rank
@@ Property / cites work @@
+Characterizations and algorithmic applications of chordal graph embeddings
+Normal rank
@@ Property / cites work @@
+Graph minors. III. Planar tree-width
@@ Property / cites work: Graph minors. III. Planar tree-width / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+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 @@
+Treewidth of Circular-Arc Graphs
@@ Property / cites work: Treewidth of Circular-Arc Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+All structured programs have small tree width and good register allocation
+Normal rank
@@ Property / cites work @@
+Computing the Minimum Fill-In is NP-Complete
@@ Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank @@
+Normal rank