Search alternatives:
data collection » a collection
Cover Image
Read Now

1
Published 1996
Springer Berlin Heidelberg
Table of Contents: “... partitioning problems on partial k-trees -- Making an arbitrary filled graph minimal by removing fill edges...”