Branch decomposition heuristics for linear matroids

Robertson, 1991, Graph minors X: obstructions to tree-decomposition, J. Combin. Theory Ser. B, 52, 153, 10.1016/0095-8956(91)90061-N Bern, 1987, Linear time computation of optimal subgraphs of decomposable graphs, J. Algorithms, 8, 216, 10.1016/0196-6774(87)90039-3 Courcelle, 1990, The monadic second-order logic of graphs I: recognizable sets of finite graphs, Inform. and Comput., 85, 12, 10.1016/0890-5401(90)90043-H Arnborg, 1991, Easy problems for tree-decomposable graphs, J. Algorithms, 12, 308, 10.1016/0196-6774(91)90006-K Borie, 1992, Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families, Algorithmica, 7, 555, 10.1007/BF01758777 Seymour, 1994, Call routing and the ratcatcher, Combinatorica, 4, 217, 10.1007/BF01215352 Cook, 2003, Tour merging via branch decomposition, INFORMS J. Comput., 15, 233, 10.1287/ijoc.15.3.233.16078 Hicks, 2002, Branchwidth heuristics, Congr. Numer., 159, 31 Oum, 2006, Approximating clique-width and branchwidth, J. Combin. Theory Ser. B, 96, 514, 10.1016/j.jctb.2005.10.006 Cunningham, 2007, On integer programming and the branchwidth of the constraint matrix, vol. 4513, 158 Hicks, 2007, The branchwidth of graphs and their cycle matroids, J. Combin. Theory Ser. B, 97, 681, 10.1016/j.jctb.2006.12.007 Mazoit, 2007, Branchwidth of graphic matroids, 275 S. Oum, Graphs of bounded rank-width, Ph.D. Thesis, Princeton University, 2005. Oum, 2005, Rank-width and vertex-minors, J. Combin. Theory Ser. B, 95, 79, 10.1016/j.jctb.2005.03.003 Belkin, 2003, Using manifold structure for partially labelled classification, 953 Belkin, 2003, Laplacian eigenmaps for dimensionality reduction and data representation, Neural Comput., 15, 1373, 10.1162/089976603321780317 Szlam, 2008, Regularization on graphs with function-adapted diffusion processes, J. Mach. Learn. Res., 9, 1711 Alon, 1986, Eigenvalues and expanders, Combinatorica, 6, 83, 10.1007/BF02579166 Chung, 1997 Shi, 2000, Normalized cuts and image segmentation, IEEE Trans. Pattern Anal. Mach. Intell., 22, 888, 10.1109/34.868688 Bodlaender, 2010, Treewidth computations I. Upper bounds, Inform. Comput., 208, 259, 10.1016/j.ic.2009.03.008 Tutte, 1965, Menger’s theorem for matroids, J. Res. Natl. Bur. Stand. Sec. B Math. Math. Phys., 69, 49, 10.6028/jres.069B.002 Diestel, 2006 Oxley, 1992 Geelen, 2003, On the excluded minors for the matroids of branchwidth k, J. Combin. Theory Ser. B, 88, 261, 10.1016/S0095-8956(02)00046-1 Dummit, 2003 Cunningham, 1986, Improved bounds for matroid partition and intersection algorithms, SIAM J. Comput., 15, 948, 10.1137/0215066 Hlinený, 2002, On the excluded minors for the matroids of branchwidth three, Electron. J. Combin., 9, R32, 10.37236/1648 Jelinek, 2010, The rank-width of a square grid, Discrete Appl. Math., 158, 841, 10.1016/j.dam.2009.02.007 Hicks, 2005, Planar branch decompositions I: the ratcatcher, INFORMS J. Comput., 17, 402, 10.1287/ijoc.1040.0075