Tangle bases: Revisited
Tangle bases: Revisited
复制标题
缠结基地:重新审视
DOI:
10.1002/net.21979
复制
发表时间:
2020
期刊:
影响因子:
2.1
通讯作者:
Brimkov, Boris
中科院分区:
文献类型:
--
作者:
Hicks, Illya V.;Brimkov, Boris
The concept of branch decomposition was first introduced by Robertson and Seymour in their proof of the Graph Minors Theorem, and can be seen as a measure of the global connectivity of a graph. Since then, branch decomposition and branchwidth have been used for computationally solving combinatorial optimization problems modeled on graphs and matroids. General branchwidth is the extension of branchwidth to any symmetric submodular function defined over a finite set. General branchwidth encompasses graphic branchwidth, matroidal branchwidth, and rankwidth. A tangle basis is related to a tangle, a notion also introduced by Robertson and Seymour; however, a tangle basis is more constructive in nature. It was shown in [I. V. Hicks. Graphs, branchwidth, and tangles! Oh my!Networks, 45:55‐60, 2005] that a tangle basis of orderkis coextensive to a tangle of orderk. In this paper, we revisit the construction of tangle bases computationally for other branchwidth parameters and show that the tangle basis approach is still competitive for computing optimal branch decompositions for general branchwidth.
登录
查看更多内容
DOI:
10.1017/cbo9780511666209.010
发表时间:
2007
期刊:
--
影响因子:
--
作者:
Frédéric Mazoit;Stéphan Thomassé
通讯作者:
Stéphan Thomassé
影响因子:
--
作者:
BERN, MW;LAWLER, EL;WONG, AL
通讯作者:
WONG, AL
DOI:
--
发表时间:
2005
期刊:
Embedded Systems and Applications
影响因子:
--
作者:
C. Paul;J. A. Telle
通讯作者:
J. A. Telle
影响因子:
0.9
作者:
D. Archdeacon
通讯作者:
D. Archdeacon
DOI:
--
发表时间:
1999
期刊:
J. Algorithms
影响因子:
--
作者:
H. Bodlaender;D. Thilikos
通讯作者:
D. Thilikos