Finding Branch-Decompositions and Rank-Decompositions

@article{Hlinen2008FindingBA,
  title={Finding Branch-Decompositions and Rank-Decompositions},
  author={Petr Hlinen{\'y} and Sang-il Oum},
  journal={SIAM J. Comput.},
  year={2008},
  volume={38},
  pages={1012-1032}
}
We present a new algorithm that can output the rank-decomposition of width at most k of a graph if such exists. For that we use an algorithm that, for an input matroid represented over a fixed finite field, outputs its branch-decomposition of width at most k if such exists. This algorithm works also for partitioned matroids. Both these algorithms are fixed-parameter tractable, that is, they run in time O(n3) for each fixed value of k where n is the number of vertices / elements of the input… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 37 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 26 references

Graph minors

  • N. Robertson, P. Seymour
  • X. Obstructions to tree-decomposition. J. Combin…
  • 1991
Highly Influential
4 Excerpts

The packing problem in statistics , coding theory and finite projective spaces : update 2001 . In Finite geometries

  • I. V. Hicks, McMurray
  • J . Combin . Theory Ser . B
  • 2007

Similar Papers

Loading similar papers…