Informace o publikaci
Computing representations of matroids of bounded branch-width
| Autoři | |
|---|---|
| Rok publikování | 2007 |
| Druh | Článek v odborném periodiku |
| Časopis / Zdroj | Stacs 2007, Proceedings |
| Citace | |
| Popis | For every k >= I 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. |