Isomorph-Free Exhaustive Generation
From MaRDI portal
Publication:4386451
Recommendations
- A general backtrack algorithm for the isomorphism problem of combinatorial objects
- Mathematical Foundations of Computer Science 2003
- scientific article; zbMATH DE number 1522743
- Isomorph-Free Exhaustive Generation of Designs with Prescribed Groups of Automorphisms
- The random selection of unlabeled graphs
Cited in
(only showing first 100 items - show all)- Classification of simple 2-(11,3,3) designs
- GrInvIn in a nutshell
- Graph based isomorph-free generation of two-level regular fractional factorial designs
- Generating water clusters and other directed graphs
- Isomorphism-free lexicographic enumeration of triangulated surfaces and 3-manifolds
- Classification of Griesmer codes and dual transform
- A general backtrack algorithm for the isomorphism problem of combinatorial objects
- 3- and 4-critical graphs of small even order
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- Efficient generation of triconnected plane triangulations.
- A classification of the six-point prime metrics
- An orderly algorithm and some applications in finite geometry
- Boundary uniqueness of fusenes
- An inductive definition of cubic toroidal maps
- A Kochen-Specker system has at least 22 vectors
- Some new upper bounds of \(\operatorname{ex}(n;\{C_3,C_4\})\)
- Enumeration of Seidel matrices
- Symmetries of unlabelled planar triangulations
- The sextuply shortened binary Golay code is optimal
- A computer-assisted proof of the uniqueness of the Perkel graph
- New results on codes with covering radius 1 and minimum distance 2
- Backtrack search with isomorph rejection and consistency check
- Miscellaneous classification results for 2-designs
- Efficient generation of plane trees.
- Computers and discovery in algebraic graph theory
- A new lower bound for the football pool problem for six matches
- Efficient exhaustive listings of reversible one dimensional cellular automata
- The number of pessimistic guesses in generalized black-peg mastermind
- Counting proper colourings in 4-regular graphs via the Potts model
- Combinatorial games modeling seki in Go
- On triangular matroids induced by \(n_3\)-configurations
- Boosting isomorphic model filtering with invariants
- Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs
- Almost-equidistant sets
- Optimal binary LCD codes
- Algebraic conditions and the sparsity of spectrally arbitrary patterns
- Constructing unlabelled lattices
- The worst case number of questions in generalized AB game with and without white-peg answers
- Exhaustive search for snake-in-the-box codes
- Characteristic-independence of Betti numbers of graph ideals
- Breaking symmetries in graph search with canonizing sets
- Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays
- Cocyclic Hadamard matrices over Latin rectangles
- On the minimum size of 4-uniform hypergraphs without property \(B\)
- G-Tries: a data structure for storing and finding subgraphs
- Graphs whose complement and square are isomorphic
- Symmetric ILP: Coloring and small integers
- Matroids with nine elements
- Equivalence-free exhaustive generation of matroid representations
- On the binary projective codes with dimension 6
- Support measures for graph data
- On directed-convex polyominoes in a rectangle
- Chromatic-index-critical graphs of orders 13 and 14
- Classification of three-class association schemes using backtracking with dynamic variable ordering
- Generation of simple quadrangulations of the sphere
- Construction of planar triangulations with minimum degree 5
- Characterizing 2-crossing-critical graphs
- Generating effective symmetry-breaking predicates for search problems
- Fast generation of some classes of planar graphs
- Generating effective symmetry-breaking predicates for search problems
- Counting Hamiltonian cycles in bipartite graphs
- On the classification of Hadamard matrices of order 32
- The complete k-arcs of PG(2, 27) and PG(2, 29)
- On searching for small Kochen-Specker vector systems
- The complete \((k, 3)\)-arcs of \(\mathrm{PG}(2,q), q\leq 13\)
- The number of Latin squares of order 11
- Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs
- On strongly asymmetric and controllable primitive graphs
- A note on non-reconstructible 3-hypergraphs
- Constraint Orbital Branching
- A full classification of the complete \(k\)-arcs of \(\mathrm{PG}(2,23)\) and \(\mathrm{PG}(2,25)\).
- An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants
- Recursive Generation of 5-Regular Planar Graphs
- Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
- Generating All Triangulations of Plane Graphs (Extended Abstract)
- There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK14
- scientific article; zbMATH DE number 3917126 (Why is no real title available?)
- Generation of various classes of trivalent graphs
- Enumerating cube tilings
- New Kochen-Specker sets in four dimensions
- Extremal graphs without three‐cycles or four‐cycles
- Efficient Algorithms for Listing Combinatorial Structures
- scientific article; zbMATH DE number 1004934 (Why is no real title available?)
- Efficient enumeration of ordered trees with \(k\) leaves
- scientific article; zbMATH DE number 2079848 (Why is no real title available?)
- scientific article; zbMATH DE number 1504644 (Why is no real title available?)
- scientific article; zbMATH DE number 1522743 (Why is no real title available?)
- Improved bounds for hypo-Hamiltonian graphs
- Representing equivalence problems for combinatorial objects
- R(4, 5) = 25
- There are 526,915,620 nonisomorphic one‐factorizations of K12
- On the maximum length of coil-in-the-box codes in dimension 8
- On hypercube packings, blocking sets and a covering problem
- The Steiner triple systems of order 19
- ENUMERATING TRIANGULATIONS IN GENERAL DIMENSIONS
- scientific article; zbMATH DE number 898423 (Why is no real title available?)
- Hadamard matrices of order 32
- Exact algorithms for the solution of the grey pattern quadratic assignment problem
- Recursive generation of IPR fullerenes
- Generation of colored graphs with isomorphism rejection
This page was built for publication: Isomorph-Free Exhaustive Generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4386451)
