Isomorph-Free Exhaustive Generation
From MaRDI portal
Publication:4386451
DOI10.1006/jagm.1997.0898zbMath0894.68107OpenAlexW1999227640WikidataQ63814547 ScholiaQ63814547MaRDI QIDQ4386451
Publication date: 26 April 1998
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/8c3b0ff6b5b410f9af07b0c94e0f40ed0bbab855
Related Items
A proof system for graph (non)-isomorphism verification, Classifying Simplicial Dissections of Convex Polyhedra with Symmetry, Classification of Linear Codes by Extending Their Residuals, The Program Generation in the Software Package QextNewEdition, The Classification of Subfactors with Index at Most 5\frac{1}4, HOW MANY QUESTIONS DO YOU NEED TO PROVE THAT UNASKED QUESTIONS HAVE NO ANSWERS?, Verifying Faradžev-Read Type Isomorph-Free Exhaustive Generation, The Steiner triple systems of order 19, ENUMERATING TRIANGULATIONS IN GENERAL DIMENSIONS, Extremal Graphs With a Given Number of Perfect Matchings, Computing Autotopism Groups of Partial Latin Rectangles, Planar hypohamiltonian oriented graphs, Algorithms and complexity for counting configurations in Steiner triple systems, Classification of minimal blocking sets in PG(2,9), Sparse Steiner triple systems of order 21, Quaternary complex Hadamard matrices of order 18, On classifying Minkowskian sublattices, Listing All Plane Graphs, The Mendelsohn Triple Systems of Order 13, Reconstruction of small graphs and digraphs, Hadamard Matrices of Order 32, Partial Latin Squares Having a Santilli’s Autotopism in their Autotopism Groups, Integer Programming for Classifying Orthogonal Arrays, An adaptive prefix-assignment technique for symmetry reduction, A class of Ramsey-extremal hypergraphs, Graphs with few hamiltonian cycles, Enumeration of Steiner triple systems with subsystems, There are 526,915,620 nonisomorphic one‐factorizations of K12, An inductive definition of cubic toroidal maps, Quasi-symmetric designs on 56 points, The complete (k, 3)-arcs of PG(2,q), q≤13, Characteristic-independence of Betti numbers of graph ideals, Efficient exhaustive listings of reversible one dimensional cellular automata, The number of Latin squares of order 11, Extremal graphs without three‐cycles or four‐cycles, Characterizing 2-crossing-critical graphs, Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs, 3- and 4-critical graphs of small even order, Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs, The Steiner quadruple systems of order 16, Generating effective symmetry-breaking predicates for search problems, On strongly asymmetric and controllable primitive graphs, A note on non-reconstructible 3-hypergraphs, Breaking symmetries in graph search with canonizing sets, Unnamed Item, Unnamed Item, An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants, A Kochen-Specker system has at least 22 vectors, Old and new results on algebraic connectivity of graphs, Almost-equidistant sets, Classification of triangle-free \(22_3\) configurations, Orderly algorithm to enumerate central groupoids and their graphs, Some new upper bounds of \(\operatorname{ex}(n;\{C_3,C_4\})\), Fractionation in planar kinematic chains: reconciling enumeration contradictions, Generation of various classes of trivalent graphs, Enumerating cube tilings, Enumeration of Seidel matrices, Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays, Constraint Orbital Branching, Cocyclic Hadamard matrices over Latin rectangles, New Kochen-Specker sets in four dimensions, Numerical measures for two-graphs, The number of pessimistic guesses in generalized black-peg mastermind, Symmetries of unlabelled planar triangulations, Improved bounds for hypohamiltonian graphs, On the minimum size of 4-uniform hypergraphs without property \(B\), G-Tries: a data structure for storing and finding subgraphs, Efficient enumeration of ordered trees with \(k\) leaves, Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures, Efficient generation of triconnected plane triangulations., Graphs whose complement and square are isomorphic, The sextuply shortened binary Golay code is optimal, On the maximum length of coil-in-the-box codes in dimension 8, On hypercube packings, blocking sets and a covering problem, Matroid enumeration for incidence geometry, Optimal binary LCD codes, Exact algorithms for the solution of the grey pattern quadratic assignment problem, Algebraic conditions and the sparsity of spectrally arbitrary patterns, Recursive generation of IPR fullerenes, Symmetric ILP: Coloring and small integers, Counting proper colourings in 4-regular graphs via the Potts model, Generating maps on surfaces, Feynman graph generation and calculations in the Hopf algebra of Feynman graphs, Matroids with nine elements, A full classification of the complete k‐arcs of PG(2,23) and PG(2,25), Multi-Latin squares, A census of \(t\)-\((t+8,t+2,4)4\) designs, \(2\leq t\leq 4\), A computer-assisted proof of the uniqueness of the Perkel graph, Combinatorial games modeling seki in Go, Equivalence-free exhaustive generation of matroid representations, On the binary projective codes with dimension 6, New results on codes with covering radius 1 and minimum distance \(2\), The number of pessimistic guesses in Generalized Mastermind, On the classification of Hadamard matrices of order 32, 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), Support measures for graph data, Constructing unlabelled lattices, R(4, 5) = 25, There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK14, Automated generation of conjectures on forbidden subgraph characterization, Classification of simple 2-(11,3,3) designs, Generating all finite modular lattices of a given size, The complete k-arcs of PG(2, 27) and PG(2, 29), On triangular matroids induced by \(n_3\)-configurations, GrInvIn in a nutshell, On Searching for Small Kochen-Specker Vector Systems, Miscellaneous classification results for 2-designs, Graph based isomorph-free generation of two-level regular fractional factorial designs, Generating water clusters and other directed graphs, Boosting isomorphic model filtering with invariants, Isomorphism-free lexicographic enumeration of triangulated surfaces and 3-manifolds, Classification of Griesmer codes and dual transform, On directed-convex polyominoes in a rectangle, A classification of the six-point prime metrics, An orderly algorithm and some applications in finite geometry, Chromatic-index-critical graphs of orders 13 and 14, Classification of three-class association schemes using backtracking with dynamic variable ordering, Efficient generation of plane trees., The worst case number of questions in generalized AB game with and without white-peg answers, Computers and discovery in algebraic graph theory, Generation of simple quadrangulations of the sphere, Construction of planar triangulations with minimum degree 5, Boundary uniqueness of fusenes, Counting Hamiltonian cycles in bipartite graphs, A new lower bound for the football pool problem for six matches, Exhaustive search for snake-in-the-box codes
Uses Software
