| dc.contributor.author | Hliněný, Petr | |
| dc.date.accessioned | 2006-10-24T13:20:17Z | |
| dc.date.available | 2006-10-24T13:20:17Z | |
| dc.date.issued | 2003 | |
| dc.identifier.citation | Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003. Proceedings. 2003, p. 470-479. | en |
| dc.identifier.isbn | 978-3-540-40671-6 | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.uri | http://hdl.handle.net/10084/57357 | |
| dc.description.abstract | It has been proved by the author that all matroid properties definable in the monadic second-order (MSO) logic can be recognized in polynomial time for matroids of bounded branch-width which are represented by matrices over finite fields. (This result extends so called MS 2-theorem of graphs by Courcelle and others.) In this work we review the MSO theory of finite matroids and show some interesting matroid properties which are MSO-definable. In particular, all minor-closed properties are recognizable in such way. | en |
| dc.language.iso | en | en |
| dc.publisher | Springer | en |
| dc.relation.ispartofseries | Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003. Proceedings | en |
| dc.relation.uri | http://dx.doi.org/10.1007/b11836 | en |
| dc.subject | matroid | en |
| dc.subject | branch-width | en |
| dc.subject | MSO logic | en |
| dc.subject | parametrized complexity | en |
| dc.title | On matroid properties definable in the MSO logic | en |
| dc.type | article | en |
| dc.identifier.location | Není ve fondu ÚK | en |
| dc.identifier.doi | 10.1007/b11836 | |
| dc.identifier.wos | 000185947800041 | |