Computing the treewidth and the minimum fill-in with the modular decomposition
From MaRDI portal
Publication:1402225
DOI10.1007/s00453-003-1026-5zbMath1045.68151WikidataQ59567877 ScholiaQ59567877MaRDI QIDQ1402225
Hans L. Bodlaender, Udi Rotics
Publication date: 19 August 2003
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://dspace.library.uu.nl/handle/1874/23972
Polynomial algorithms; Graph algorithms; Modular decomposition; Treewidth; Minimal separators; Minimum fill-in