Branch decomposition heuristics for linear matroids
From MaRDI portal
Publication:2445840
DOI10.1016/j.disopt.2012.11.004zbMath1284.05053OpenAlexW1990215343MaRDI QIDQ2445840
Edray Herber Goins, Susan Margulies, Illya V. Hicks, Jing Ma
Publication date: 15 April 2014
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2012.11.004
Related Items (1)
Uses Software
Cites Work
- On the excluded minors for matroids of branch-width three
- Treewidth computations. I: Upper bounds
- The rank-width of the square grid
- Eigenvalues and expanders
- Graph minors. X: Obstructions to tree-decomposition
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
- Call routing and the ratcatcher
- On the excluded minors for the matroids of branch-width \(k\)
- Approximating clique-width and branch-width
- Rank-width and vertex-minors
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The branchwidth of graphs and their cycle matroids
- Tour Merging via Branch-Decomposition
- Planar Branch Decompositions I: The Ratcatcher
- Easy problems for tree-decomposable graphs
- Improved Bounds for Matroid Partition and Intersection Algorithms
- Linear-time computation of optimal subgraphs of decomposable graphs
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- On Integer Programming and the Branch-Width of the Constraint Matrix
- Menger's theorem for matroids
- Graph-Theoretic Concepts in Computer Science
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Branch decomposition heuristics for linear matroids
