A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs

DOI10.1016/S0166-218X(99)00146-8zbMath0940.05064OpenAlexW2040405987MaRDI QIDQ1962057

Could not fetch data.

Publication date: 19 July 2000

Published in: (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00146-8

zbMATH Keywords

Could not fetch data.

Mathematics Subject Classification ID

Could not fetch data.