| dc.contributor.author | Hliněný, Petr | |
| dc.date.accessioned | 2006-09-21T11:41:47Z | |
| dc.date.available | 2006-09-21T11:41:47Z | |
| dc.date.issued | 2006 | |
| dc.identifier.citation | Discrete Applied Mathematics. 2006, vol. 154, issue 8, p. 1210-1222. | en |
| dc.identifier.issn | 0166-218X | |
| dc.identifier.uri | http://hdl.handle.net/10084/56348 | |
| dc.description.abstract | In this paper we present an algorithm for the problem of exhaustive equivalence-free generation of 3-connected matroids which are represented by a matrix over some finite (partial) field, and which contain a given minor. The nature of this problem is exponential, and it appears to be much harder than, say, isomorph-free generation of graphs. Still, our algorithm is very suitable for practical use, and it has been successfully implemented in our matroid computing package MACEK [http://www.mcs.vuw.ac.nz/research/macek, 2001–05]. | en |
| dc.language.iso | en | en |
| dc.publisher | North-Holland | en |
| dc.relation.ispartofseries | Discrete Applied Mathematics | en |
| dc.relation.uri | https://doi.org/10.1016/j.dam.2005.12.001 | en |
| dc.subject | matroid representation | en |
| dc.subject | matroid extension | en |
| dc.subject | exhaustive generation | en |
| dc.subject | canonical construction path | en |
| dc.title | Equivalence-free exhaustive generation of matroid representations | en |
| dc.type | article | en |
| dc.identifier.location | Není ve fondu ÚK | en |
| dc.identifier.doi | 10.1016/j.dam.2005.12.001 | |
| dc.identifier.wos | 000237172100005 | |