Minimal split completions (Q967310): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2008.08.010
+Normal rank
@@ Property / OpenAlex ID @@
+W2117458675
@@ Property / OpenAlex ID: W2117458675 / rank @@
+Normal rank
@@ Property / cites work @@
+Inheritance principles for chordal graphs
@@ Property / cites work: Inheritance principles for chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Several results on chordal bipartite graphs
@@ Property / cites work: Several results on chordal bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A wide-range algorithm for minimal triangulation from an arbitrary ordering
+Normal rank
@@ Property / cites work @@
+A practical algorithm for making filled graphs minimal
+Normal rank
@@ Property / cites work @@
+Treewidth and Minimum Fill-in: Grouping the Minimal Separators
+Normal rank
@@ Property / cites work @@
+Q4193514
@@ Property / cites work: Q4193514 / rank @@
+Normal rank
@@ Property / cites work @@
+`` Strong '' NP-Completeness Results
@@ Property / cites work: `` Strong '' NP-Completeness Results / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic graph theory and perfect graphs
@@ Property / cites work: Algorithmic graph theory and perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The splittance of a graph
@@ Property / cites work: The splittance of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal triangulations of graphs: a survey
@@ Property / cites work: Minimal triangulations of graphs: a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizing Minimal Interval Completions
@@ Property / cites work: Characterizing Minimal Interval Completions / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376)
+Normal rank
@@ Property / cites work @@
+Fully dynamic algorithms for chordal graphs and split graphs
+Normal rank
@@ Property / cites work @@
+On treewidth and minimum fill-in of asteroidal triple-free graphs
+Normal rank
@@ Property / cites work @@
+Minimal fill in O(\(n^{2.69}\)) time
@@ Property / cites work: Minimal fill in O(\(n^{2.69}\)) time / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity classification of some edge modification problems
+Normal rank
@@ Property / cites work @@
+Characterizations and algorithmic applications of chordal graph embeddings
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Vertex Elimination on Graphs
+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
@@ links / mardi / name / links / mardi / name @@
+Publication:967310