Abstract. We construct a polynomial-time algorithm to approximate the branch-width of certain symmetric submodular functions, and give two applications.
Approximating clique-width and branch-width - ScienceDirect.com
www.sciencedirect.com › article › pii
We construct a polynomial-time algorithm to approximate the branch-width of certain symmetric submodular functions, and give two applications. The first is to ...
Approximating clique-width and branch-width - ResearchGate
www.researchgate.net › publication › 22...
Oct 22, 2024 · We construct a polynomial-time algorithm to approximate the branch-width of certain symmetric submodular functions, and give two ...
Approximating clique-width and branch-width. We construct a polynomial-time algorithm to approximate the branch-width of certain symmetric sub-modular functions ...
Rank-width was defined by Oum and Seymour [2006. Approximating clique-width and branch- width. J. Combin. Theory Ser. B 96, 4, 514–528] to investigate clique- ...
This can be reformulated in terms of clique-width as an algorithm that either outputs a (21 + f(k)–1)-expression or confirms clique-width is larger than k in O ...
We construct a polynomial-time algorithm to approximate the branch-width of certain symmetric submodular functions, and give two applications.
The branch-width bw(M) of M is the minimum width of a branch- decomposition of M. (If |V | ≤ 1, we define bw(M) = 1.) Branch-width has been defined by Robertson ...
Boolean-width and rank-width can be used to approximate clique-width, however, the error can be exponential in the clique-width; in con- trast, treewidth and ...
Oct 22, 2024 · This can be reformulated in terms of clique-width as an algorithm that either outputs a (2(1+f(k)) - 1)-expression or confirms clique-width is ...