Další formáty:
BibTeX
LaTeX
RIS
@article{634130,
author = {Hliněný, Petr},
article_location = {Amsterdam},
article_number = {8},
keywords = {Matroid representation; Matroid extension; Exhaustive generation; Canonical construction path},
language = {eng},
issn = {0166-218X},
journal = {Discrete Applied Mathematics},
title = {Equivalence-free exhaustive generation of matroid representations},
url = {http://dx.doi.org/10.1016/j.dam.2005.12.001},
volume = {154},
year = {2006}
}
TY - JOUR
ID - 634130
AU - Hliněný, Petr
PY - 2006
TI - Equivalence-free exhaustive generation of matroid representations
JF - Discrete Applied Mathematics
VL - 154
IS - 8
SP - 1210-1222
EP - 1210-1222
PB - Elsevier B.V.
SN - 0166218X
KW - Matroid representation
KW - Matroid extension
KW - Exhaustive generation
KW - Canonical construction path
UR - http://dx.doi.org/10.1016/j.dam.2005.12.001
N2 - 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].
ER -
HLINĚNÝ, Petr. Equivalence-free exhaustive generation of matroid representations. \textit{Discrete Applied Mathematics}. Amsterdam: Elsevier B.V., 2006, roč.~154, č.~8, s.~1210-1222. ISSN~0166-218X.
|
