Computing Representations of Matroids of Bounded Branch-Width

For every k ≥ 1 and two finite fields F and F , we design a polynomial-time algorithm that given a matroid M of branch-width at most k represented over F decides whether M is representable over F and if so, it computes a representation of M over F . The algorithm also counts the number of non-isomorphic representations of M over F . Moreover, it can be modified to list all such non-isomorphic representations.

• Type: Conference
• Year: 2007
• Where: STACS
• Authors: Daniel Král
• Keywords: Non-isomorphic Representations, Polynomial-time Algorithm, STACS 2007, Theoretical Computer Science, finite fields