A revisit of the scheme for computing treewidth and minimum fill-in

0Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

In this paper, we reformulate the scheme introduced by Bouchitte´ and Todinca in [1], which computes treewidth and minimum fill-in of a graph using a dynamic programming approach. We will call the scheme BT scheme. Although BT scheme was originally designed for computing treewidth and minimum fill-in, it can be used for computing other graph parameters defined in terms of minimal triangulation. In this paper, we reformulate BT scheme so that it works for computing other graph parameters defined in terms of minimal triangulation, and give examples of other graph parameters.

Cite

CITATION STYLE

APA

Furuse, M., & Yamazaki, K. (2014). A revisit of the scheme for computing treewidth and minimum fill-in. Theoretical Computer Science, 531, 66–76. https://doi.org/10.1016/j.tcs.2014.03.013

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free