Finding minimum height elimination trees for interval graphs in polynomial time (Q1347072): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Power of Natural Semijoins
@@ Property / cites work: Power of Natural Semijoins / rank @@
+Normal rank
@@ Property / cites work @@
+Q4288578
@@ Property / cites work: Q4288578 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4764622
@@ Property / cites work: Q4764622 / rank @@
+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 @@
+Q4100000
@@ Property / cites work: Q4100000 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4942652
@@ Property / cites work: Q4942652 / rank @@
+Normal rank
@@ Property / cites work @@
+On rigid circuit graphs
@@ Property / cites work: On rigid circuit graphs / 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 @@
+The intersection graphs of subtrees in trees are exactly the chordal graphs
+Normal rank
@@ Property / cites work @@
+A Characterization of Comparability Graphs and of Interval Graphs
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5588563
@@ Property / cites work: Q5588563 / rank @@
+Normal rank
@@ Property / cites work @@
+Counting clique trees and computing perfect elimination schemes in parallel
+Normal rank
@@ Property / cites work @@
+The Role of Elimination Trees in Sparse Factorization
+Normal rank
@@ Property / cites work @@
+Q5653953
@@ Property / cites work: Q5653953 / rank @@
+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 @@
+Computing the Minimum Fill-In is NP-Complete
@@ Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01934264
+Normal rank
@@ Property / OpenAlex ID @@
+W2070592419
@@ Property / OpenAlex ID: W2070592419 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1347072