Largest chordal and interval subgraphs faster than $2^n$ (Q329301): Difference between revisions

@@ Property / author @@
-Ivan A. Bliznets
@@ Property / author: Ivan A. Bliznets / rank @@
-Normal rank
@@ Property / author @@
+Ivan A. Bliznets
@@ Property / author: Ivan A. Bliznets / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2172016099
@@ Property / OpenAlex ID: W2172016099 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q59473710
@@ Property / Wikidata QID: Q59473710 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.4055
@@ Property / arXiv ID: 1311.4055 / rank @@
+Normal rank
@@ Property / cites work @@
+Largest Chordal and Interval Subgraphs Faster Than 2 n
+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 @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing Berge graphs
@@ Property / cites work: Recognizing Berge graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The strong perfect graph theorem
@@ Property / cites work: The strong perfect graph theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Iterative compression and exact algorithms
@@ Property / cites work: Iterative compression and exact algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+On the minimum feedback vertex set problem: Exact and enumeration algorithms
+Normal rank
@@ Property / cites work @@
+Exact exponential algorithms.
@@ Property / cites work: Exact exponential algorithms. / rank @@
+Normal rank
@@ Property / cites work @@
+Exact Algorithm for the Maximum Induced Planar Subgraph Problem
+Normal rank
@@ Property / cites work @@
+Large Induced Subgraphs via Triangulations and CMSO
+Normal rank
@@ Property / cites work @@
+Finding Induced Subgraphs via Minimal Triangulations
+Normal rank
@@ Property / cites work @@
+Treewidth computation and extremal combinatorics
@@ Property / cites work: Treewidth computation and extremal combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+On independent sets and bicliques in graphs
@@ Property / cites work: On independent sets and bicliques in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Chordal Graphs
@@ Property / cites work: A Separator Theorem for Chordal Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum $r$-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds
+Normal rank
@@ Property / cites work @@
+Representation of a finite graph by a set of intervals on the real line
+Normal rank
@@ Property / cites work @@
+The node-deletion problem for hereditary properties is NP-complete
+Normal rank
@@ Property / cites work @@
+Finding a Maximum Induced Degenerate Subgraph Faster Than 2 n
+Normal rank
@@ Property / cites work @@
+Efficient exact algorithms through enumerating maximal independent sets and other techniques
+Normal rank
@@ Property / cites work @@
+Algorithms for maximum independent sets
@@ Property / cites work: Algorithms for maximum independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Vertex Elimination on Graphs
+Normal rank
@@ Property / cites work @@
+A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:329301

Largest chordal and interval subgraphs faster than \(2^n\) (Q329301): Difference between revisions

Latest revision as of 19:31, 12 July 2024

Statements

Sitelinks

Mathematics(1 entry)