New Upper Bound Heuristics for Treewidth

Emgad H. Bachoore, Hans Leo Bodlaender. New Upper Bound Heuristics for Treewidth. In Sotiris E. Nikoletseas, editor, Experimental and Efficient Algorithms, 4th InternationalWorkshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005, Proceedings. Volume 3503 of Lecture Notes in Computer Science, pages 216-227, Springer, 2005. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.