Faster parameterized algorithms for \textsc{Minimum Fill-in}
type: Item
instance of: scholarly article
title: Faster parameterized algorithms for \textsc{Minimum Fill-in}
zbMATH Open document ID: 1230.68100
author: Hans L. Bodlaender
author: Pinar Heggernes
author: Yngve Villanger
published in: Algorithmica
publication date: 2011-12-14T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5988475
zbMATH Keywords: minimum fill-in
zbMATH Keywords: parameterized algorithms
zbMATH Keywords: chordal graphs
zbMATH Keywords: fixed-parameter tractability
MaRDI profile type: Publication
Wikidata QID: Q59567595
full work available at URL: s00453-010-9421-1
OpenAlex ID: W2124174860
cites work: Moplex elimination orderings
cites work: A vertex incremental approach for maintaining chordality
cites work: Listing all potential maximal cliques of a graph
cites work: A characterisation of rigid circuit graphs
cites work: Fixed-parameter tractability of graph modification problems for hereditary properties
cites work: Chordal completions of planar graphs
cites work: On rigid circuit graphs
cites work: Treewidth Computation and Extremal Combinatorics
cites work: Exact Algorithms for Treewidth and Minimum Fill-In
cites work: Incidence matrices and interval graphs
cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs
cites work: Q3328583
cites work: Minimal triangulations of graphs: a survey
cites work: Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
cites work: Q4734791
cites work: Representation of a finite graph by a set of intervals on the real line
cites work: A Polynomial Approximation Algorithm for the Minimum Fill-In Problem
cites work: Q5710169
cites work: Characterizations and algorithmic applications of chordal graph embeddings
cites work: Triangulated graphs and the elimination process
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
DOI: 10.1007/S00453-010-9421-1
description: scientific article; zbMATH DE number 5988475