| HLINĚNÝ, Petr. Combinatorial Generation of Matroid Representations: Theory and Practice. Acta Universitatis Matthiae Belii, Series Mathematics. Banska Bystrica, Slovakia: Matej Bel University, 2006, vol. 12, No 1, p. 31-41. |
Other formats:
BibTeX
LaTeX
RIS
@article{637505,
author = {Hliněný, Petr},
article_location = {Banska Bystrica, Slovakia},
article_number = {1},
keywords = {representable matroid; exhaustive generation},
language = {eng},
journal = {Acta Universitatis Matthiae Belii, Series Mathematics},
title = {Combinatorial Generation of Matroid Representations: Theory and Practice},
url = {http://actamath.savbb.sk/},
volume = {12},
year = {2006}
}
TY - JOUR
ID - 637505
AU - Hliněný, Petr
PY - 2006
TI - Combinatorial Generation of Matroid Representations: Theory and Practice
JF - Acta Universitatis Matthiae Belii, Series Mathematics
VL - 12
IS - 1
SP - 31
EP - 31
PB - Matej Bel University
KW - representable matroid
KW - exhaustive generation
UR - http://actamath.savbb.sk/
N2 - Matroids (also called combinatorial geometries) present a strong combinatorial generalization of graphs and matrices. Unlike isomorph-free generation of graphs, which has been extensively studied both from theoretical and practical points of view, not much research has been done so far about matroid generation. Perhaps the main problem with matroid generation lies in a very complex internal structure of a matroid. That is why we focus on generation of suitable matroid representations, and we outline a way how to exhaustively generate matroid representations over finite fields in reasonable computing time. In particular, we extend here some enumeration results on binary (over the binary field) combinatorial geometries by Kingan et al.
ER -
HLINĚNÝ, Petr. Combinatorial Generation of Matroid Representations: Theory and Practice. \textit{Acta Universitatis Matthiae Belii, Series Mathematics}. Banska Bystrica, Slovakia: Matej Bel University, 2006, vol.~12, No~1, p.~31-41.
|
