About this document

Tree Decompositions With Small Cost by scribd.external317 is a document available to read on EtoBox.

This paper investigates tree decompositions with a focus on minimizing the f-cost, defined as the sum of a function f applied to the sizes of vertex sets in the decomposition. It establishes that for fast functions, every graph has a minimum f-cost tree decomposition corresponding to a minimal triangulation, and provides polynomial time algorithms for specific graph classes while showing NP-hardness for others. The findings have implications for algorithms in probabilistic networks and other applications wh

Author

scribd.external317

Language

EN