Q5126619 (Q5126619): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.01966
@@ Property / arXiv ID: 1612.01966 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4288579
@@ Property / cites work: Q4288579 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Desirability of Acyclic Database Schemes
@@ Property / cites work: On the Desirability of Acyclic Database Schemes / rank @@
+Normal rank
@@ Property / cites work @@
+A Benders Approach to the Minimum Chordal Completion Problem
+Normal rank
@@ Property / cites work @@
+A wide-range algorithm for minimal triangulation from an arbitrary ordering
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems
+Normal rank
@@ Property / cites work @@
+Treewidth and Minimum Fill-in: Grouping the Minimal Separators
+Normal rank
@@ Property / cites work @@
+Chordal editing is fixed-parameter tractable
@@ Property / cites work: Chordal editing is fixed-parameter tractable / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds
+Normal rank
@@ Property / cites work @@
+Chordal completions of planar graphs
@@ Property / cites work: Chordal completions of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
+Normal rank
@@ Property / cites work @@
+Minimum fill-in of sparse graphs: kernelization and approximation
+Normal rank
@@ Property / cites work @@
+Q5743514
@@ Property / cites work: Q5743514 / 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 @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The Evolution of the Minimum Degree Ordering Algorithm
+Normal rank
@@ Property / cites work @@
+Positive definite completions of partial Hermitian matrices
+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 @@
+Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
+Normal rank
@@ Property / cites work @@
+Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
+Normal rank
@@ Property / cites work @@
+Approximating the Bandwidth for 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 @@
+On a property of minimal triangulations
@@ Property / cites work: On a property of minimal triangulations / rank @@
+Normal rank
@@ Property / cites work @@
+Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network
+Normal rank
@@ Property / cites work @@
+Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
+Normal rank
@@ Property / cites work @@
+A Polynomial Approximation Algorithm for the Minimum Fill-In Problem
+Normal rank
@@ Property / cites work @@
+Detecting holes and antiholes in graphs
@@ Property / cites work: Detecting holes and antiholes in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Fast Algorithm for Finding an Optimal Ordering for Vertex Elimination on a Graph
+Normal rank
@@ Property / cites work @@
+Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
+Normal rank
@@ Property / cites work @@
+How to use the minimal separators of a graph for its chordal triangulation
+Normal rank
@@ Property / cites work @@
+Characterizations and algorithmic applications of chordal graph embeddings
+Normal rank
@@ Property / cites work @@
+The Use of Linear Graphs in Gauss Elimination
@@ Property / cites work: The Use of Linear Graphs in Gauss Elimination / rank @@
+Normal rank
@@ Property / cites work @@
+Q5683627
@@ Property / cites work: Q5683627 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Vertex Elimination on Directed Graphs
+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 @@
+Computing the Minimum Fill-In is NP-Complete
@@ Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs
+Normal rank