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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bui-Xuan, B.-M., Telle, J.A., Vatshelle, M.: Boolean-width of graphs. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol. 5917, pp. 61–74. Springer, Heidelberg (2009)
Courcelle, B.: The monadic second-order logic of graph I. Recognizable sets of finite graphs. Inform. and Comput. 85, 12–75 (1990)
Courcelle, B.: The expression of graph properties and graph transformations in monadic second-order logic. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformations. Foundations, vol. 1, pp. 313–400. World Scientific (1997)
Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discrete Appl. Math. 101, 77–114 (2000)
Courcelle, B., Makowsky, J.A., Rotics, U.: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discrete Appl. Math. 108, 23–52 (2001)
Hliněný, P., Whittle, G.: Matroid tree-width. European J. Combin. 27, 1117–1128 (2003)
Hliněný, P.: A parametrized algorithm for matroid branch-width. SIAM J. Computing 35, 259–277 (2005)
Hliněný, P.: Branch-width, parse trees, and monadic second-order logic for matroids. J. Combin. Theory Ser. B 96, 325–351 (2006)
Hliněný, P.: On matroid representatibility and minor problems. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 505–516. Springer, Heidelberg (2006)
Hliněný, P., Oum, S.: Finding branch-decomposition and rank-decomposition. SIAM J. Computing 38, 1012–1032 (2008)
Gavenčiak, T., Král, D., Oum, S.-I.: Deciding first order logic properties of matroids. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol. 7392, pp. 239–250. Springer, Heidelberg (2012)
Král’, D.: Computing representations of matroids of bounded branch-width. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 224–235. Springer, Heidelberg (2007)
Král’, D.: Decomposition width of matroids. Discrete Appl. Math. 160, 913–923 (2012)
Král’, D.: Decomposition width of matroids. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 55–66. Springer, Heidelberg (2010)
Oum, S., Seymour, P.D.: Approximating clique-width and branch-width. J. Combin. Theory Ser. B 96, 514–528 (2006)
Oum, S., Seymour, P.D.: Certifying large branch-width. In: Proc. of SODA, pp. 810–813 (2006)
Oum, S., Seymour, P.D.: Approximating clique-width and branch-width. J. Combin. Theory Ser. B 96, 514–528 (2006)
Oum, S., Seymour, P.D.: Testing branch-width. J. Combin. Theory Ser. B 97, 385–393 (2007)
Oxley, J.: Matroid Theory, 2nd edn. Oxford University Press (2011)
Robertson, N.S., Seymour, P.D.N.: Graph minors. X. Obstructions to tree-decomposition. J. Combin. Theory Ser. B 52, 153–190 (1992)
Seymour, P.: Recognizing graphic matroids. Combinatorica 1, 75–78 (1981)
Strozecki, Y.: Monadic second-order model-checking on decomposable matroids. Discrete Appl. Math. 159, 1022–1039 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Mach, L., Toufar, T. (2013). Amalgam Width of Matroids. In: Gutin, G., Szeider, S. (eds) Parameterized and Exact Computation. IPEC 2013. Lecture Notes in Computer Science, vol 8246. Springer, Cham. https://doi.org/10.1007/978-3-319-03898-8_23
Download citation
DOI: https://doi.org/10.1007/978-3-319-03898-8_23
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03897-1
Online ISBN: 978-3-319-03898-8
eBook Packages: Computer ScienceComputer Science (R0)