AbstractWe show that it is possible to find a minimal fill ordering of a graph in O(n2.69) time. Previous algorithms for the problem required Ω(n3) time on dense graphs. The algorithm uses fast matrix multiplication to produce the same ordering of vertices as Tarjan's well known LEX-M algorithm
AbstractPermutation graphs form a well-studied subclass of cocomparability graphs. Permutation graph...
AbstractGiven an arbitrary graph G=(V,E) and an interval graph H=(V,F) with E⊆F we say that H is an ...
AbstractKumar and Madhavan [Minimal vertex separators of chordal graphs, Discrete Appl. Math. 89 (19...
Abstract. Minimal elimination orderings were introduced by Rose, Tarjan, and Lueker in 1976, and dur...
AbstractFor an arbitrary filled graph G+ of a given original graph G, we consider the problem of rem...
For an arbitrary filled graph G + of a given original graph G, we consider the problem of removing...
We show that a minimum fill-in ordering of a graph can be determined in linear time if it can be mod...
We show that the treewidth and the minimum fill-in of an n-vertex graph can be computed in time O(1....
The problem of computing minimal triangulations, or minimal ll, of graphs was introduced and solved ...
When minimum orderings proved too difficult to deal with, Rose, Tarjan, and Leuker instead studied m...
AbstractWe design the first efficient parallel algorithm for computing the minimal elimination order...
We present an alternative linear time algorithm that computes an ordering that produces a fill-in th...
It is shown that the problem of maintaining the topological order of the nodes of a directed acyclic...
We present an efficient algorithm which computes the set of minimal separators of a graph in O(n³) t...
We improve upon the running time of several graph and network algorithms when applied to dense graph...
AbstractPermutation graphs form a well-studied subclass of cocomparability graphs. Permutation graph...
AbstractGiven an arbitrary graph G=(V,E) and an interval graph H=(V,F) with E⊆F we say that H is an ...
AbstractKumar and Madhavan [Minimal vertex separators of chordal graphs, Discrete Appl. Math. 89 (19...
Abstract. Minimal elimination orderings were introduced by Rose, Tarjan, and Lueker in 1976, and dur...
AbstractFor an arbitrary filled graph G+ of a given original graph G, we consider the problem of rem...
For an arbitrary filled graph G + of a given original graph G, we consider the problem of removing...
We show that a minimum fill-in ordering of a graph can be determined in linear time if it can be mod...
We show that the treewidth and the minimum fill-in of an n-vertex graph can be computed in time O(1....
The problem of computing minimal triangulations, or minimal ll, of graphs was introduced and solved ...
When minimum orderings proved too difficult to deal with, Rose, Tarjan, and Leuker instead studied m...
AbstractWe design the first efficient parallel algorithm for computing the minimal elimination order...
We present an alternative linear time algorithm that computes an ordering that produces a fill-in th...
It is shown that the problem of maintaining the topological order of the nodes of a directed acyclic...
We present an efficient algorithm which computes the set of minimal separators of a graph in O(n³) t...
We improve upon the running time of several graph and network algorithms when applied to dense graph...
AbstractPermutation graphs form a well-studied subclass of cocomparability graphs. Permutation graph...
AbstractGiven an arbitrary graph G=(V,E) and an interval graph H=(V,F) with E⊆F we say that H is an ...
AbstractKumar and Madhavan [Minimal vertex separators of chordal graphs, Discrete Appl. Math. 89 (19...
DOI
Add to ORKG