Haydi: Rapid Prototyping and Combinatorial Objects

被引:0
作者
Bohm, Stanislav [1 ]
Beranek, Jakub [1 ]
Surkovsky, Martin [1 ]
机构
[1] VSB Tech Univ Ostrava, 17 Listopadu 2172-15, Ostrava 70800, Czech Republic
来源
FOUNDATIONS OF INFORMATION AND KNOWLEDGE SYSTEMS, FOIKS 2018 | 2018年 / 10833卷
关键词
Combinatorial objects; Rapid prototyping; Canonical representation;
D O I
10.1007/978-3-319-90050-6_8
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Haydi (http://haydi.readthedocs.io) is a framework for generating discrete structures. It provides a way to define a structure from basic building blocks and then enumerate all elements, all non-isomorphic elements, or generate random elements in the structure. Haydi is designed as a tool for rapid prototyping. It is implemented as a pure Python package and supports execution in distributed environments. The goal of this paper is to give the overall picture of Haydi together with a formal definition for the case of generating canonical forms.
引用
收藏
页码:133 / 149
页数:17
相关论文
共 7 条
[1]  
[Anonymous], TECHNICAL REPORT
[2]  
Bohm S., 2017, TECHNICAL REPORT
[3]  
Cerny Jan, 1964, Matematicko-fyzikalny Casopis Slovenskej Akademie Vied, V14, P208
[4]  
Heuberger C, 2016, DISCRETE MATH THEOR, V18
[5]   Isomorph-free exhaustive generation [J].
McKay, BD .
JOURNAL OF ALGORITHMS, 1998, 26 (02) :306-324
[6]   Practical graph isomorphism, II [J].
McKay, Brendan D. ;
Piperno, Adolfo .
JOURNAL OF SYMBOLIC COMPUTATION, 2014, 60 :94-112
[7]   Synchronizing Automata and the Cerny Conjecture [J].
Volkov, Mikhail V. .
LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2008, 5196 :11-27