Decomposition width - a new width parameter for matroids
| dc.creator | Kral, Daniel | |
| dc.date | 2009-04-17 | |
| dc.date.accessioned | 2026-07-07T13:05:45Z | |
| dc.date.available | 2026-07-07T13:05:45Z | |
| dc.description | We introduce a new width parameter for matroids called decomposition width and prove that every matroid property expressible in the monadic second order logic can be computed in linear time for matroids with bounded decomposition width if their decomposition is given. Since decompositions of small width for our new notion can be computed in polynomial time for matroids of bounded branch-width represented over finite fields, our results include recent algorithmic results of Hlineny [J. Combin. Theory Ser. B 96 (2006), 325-351] in this area and extend his results to matroids not necessarily representable over finite fields. | |
| dc.identifier | https://arxiv.org/abs/0904.2785 | |
| dc.identifier | http://arxiv.org/abs/0904.2785 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/227591 | |
| dc.subject | Discrete Mathematics | |
| dc.subject | Data Structures and Algorithms | |
| dc.subject | G.2.1 | |
| dc.title | Decomposition width - a new width parameter for matroids | |
| dc.type | text |