Amalgam width of matroids

1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We introduce a new matroid width parameter based on the operation of matroid amalgamation called amalgam-width. The parameter is linearly related to branch-width on finitely representable matroids, while still allowing algorithmic applications on non-representable matroids (which is not possible for branch-width). In particular, any property expressible in the monadic second order logic can be decided in linear time for matroids with bounded amalgam-width. We also prove that the Tutte polynomial can be computed in polynomial time for matroids with bounded amalgam-width. © 2013 Springer International Publishing.

Cite

CITATION STYLE

APA

Mach, L., & Toufar, T. (2013). Amalgam width of matroids. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8246 LNCS, pp. 268–280). https://doi.org/10.1007/978-3-319-03898-8_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free