Maximum Cardinality Search for Computing Minimal Triangulations of Graphs

The Digital Librarian's Digital Library

DOCIS Documents in Computing and Information Science

Home >> Journals and Conference Proceedings >> Algorithmica

Maximum Cardinality Search for Computing Minimal Triangulations of Graphs

Anne Berry, Jean R. S. Blair, Pinar Heggernes, Barry W. Peyton

Journal Title: Algorithmica

Date: 2004

Volume: 39

Issue: 4

p. 287 - 298

We have been looking for this document on the Web. We think we have found the following, freely available version(s) of it:

http://www.ii.uib.no/~pinar/MCSM-r.ps

For further information about this item go to:

http://dx.doi.org/10.1007/s00453-004-1084-3

This data comes from DBLP

This page is maintained by Angela Cornwell and Thomas Krichel.
It was last updated on 2006-04-12