Finding minimum height elimination trees for interval graphs in polynomial time
type: Item
instance of: scholarly article
title: Finding minimum height elimination trees for interval graphs in polynomial time
zbMATH Open document ID: 0822.68071
DOI: 10.1007/BF01934264
author: Bengt Aspvall
author: Pinar Heggernes
published in: BIT
publication date: 1995-06-19T00:00:00Z
Mathematics Subject Classification ID: 68R05
zbMATH DE Number: 739434
zbMATH Keywords: elimination tree
zbMATH Keywords: sparse matrix factorization
zbMATH Keywords: interval graphs
MaRDI profile type: Publication
cites work: Power of Natural Semijoins
cites work: Q4288578
cites work: Q4764622
cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
cites work: Q4100000
cites work: Q4942652
cites work: On rigid circuit graphs
cites work: Incidence matrices and interval graphs
cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs
cites work: A Characterization of Comparability Graphs and of Interval Graphs
cites work: Q3328583
cites work: Q5588563
cites work: Counting clique trees and computing perfect elimination schemes in parallel
cites work: The Role of Elimination Trees in Sparse Factorization
cites work: Q5653953
cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
cites work: Computing the Minimum Fill-In is NP-Complete
full work available at URL: https://doi.org/10.1007/bf01934264
OpenAlex ID: W2070592419
description: scientific article; zbMATH DE number 739434