Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
From MaRDI portal
Publication:4173359
DOI10.1016/S0167-5060(08)70325-XzbMath0392.05001OpenAlexW1585305433MaRDI QIDQ4173359
Publication date: 1978
Published in: Algorithmic Aspects of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70325-x
Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items
Generating all maximal independent sets on trees in lexicographic order, Dual-bounded generating problems: Weighted transversals of a hypergraph, Quasi-symmetric designs on 56 points, Isomorphism and Invariants of Parallelisms of Projective Spaces, Nonexistence Certificates for Ovals in a Projective Plane of Order Ten, New parallelisms of \(\operatorname{PG}(3,5)\) with automorphisms of order 8, On the inverse power index problem, Efficient exhaustive listings of reversible one dimensional cellular automata, Verifying Faradžev-Read Type Isomorph-Free Exhaustive Generation, Computing the maximal canonical form for trees in polynomial time, On generating all maximal independent sets, An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation, Breaking symmetries in graph search with canonizing sets, Sets in Abelian groups with distinct sums of pairs., Construction of discrete structures, especially isomers, Pruning the search tree in the constructive enumeration of molecular graphs, Schur rings over the elementary abelian group of order 64, Steiner triple systems of order 19 with nontrivial automorphism group, Cataloguing general graphs by point and line spectra, Orderly algorithm to enumerate central groupoids and their graphs, Breaking symmetries with high dimensional graph invariants and their combination, Constraint Orbital Branching, New optimal covering arrays using an orderly algorithm, The Smallest Cubic Graphs of Girth Nine, Efficient enumeration of ordered trees with \(k\) leaves, An algebraic representation of graphs and applications to graph enumeration, Enumerations of rooted trees with an application to group presentations, Sets in \(\mathbb{Z}_n\) with distinct sums of pairs., Enumeration of balanced ternary designs., An exponential formula for polynomial vector fields. II: Lie series, exponential substitution, and rooted trees, On almost regular tournament matrices, SMALL p-GROUPS WITH FULL-RANK FACTORIZATION, There exists no (15,5,4) RBIBD, Matroid enumeration for incidence geometry, Faradžev Read-type enumeration of non-isomorphic CC systems, Biangular lines revisited, Orderly generation of half regular symmetric designs via Rahilly families of pre-difference sets, Finding all closed sets: A general approach, Enumerating Minimal Transversals of Hypergraphs without Small Holes, On the complexity of monotone dualization and generating minimal hypergraph transversals, Classification of some strongly regular subgraphs of the McLaughlin graph, Tegula -- exploring a galaxy of two-dimensional periodic tilings, Counting proper colourings in 4-regular graphs via the Potts model, There exists no (15,5,4) RBIBD†*, Finite Nilpotent Semigroups of Small Coclass, Matroids with nine elements, On minimum sum representations for weighted voting games, The near resolvable \(2\)-\((13,4,3)\) designs and thirteen-player whist tournaments, Fast generation of regular graphs and construction of cages, Hadamard Matrices of Order 32, Generating dual-bounded hypergraphs, On the classification of Hadamard matrices of order 32, Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract), An adaptive prefix-assignment technique for symmetry reduction, Constructions of maximum few-distance sets in Euclidean spaces, Pick's inequality and tournaments, On the classification of APN functions up to dimension five, Classification of simple 2-(11,3,3) designs, Generating all finite modular lattices of a given size, Tone rows and tropes, Integral point sets over \(\mathbb Z_n^m\), Orderly generation of Butson Hadamard matrices, On Searching for Small Kochen-Specker Vector Systems, Miscellaneous classification results for 2-designs, On bipartite graphs of diameter 3 and defect 2, Generation of Union Closed Sets and Moore families, Structure of cubic Lehman matrices, Isomorphism-free lexicographic enumeration of triangulated surfaces and 3-manifolds, Enumeration of Steiner triple systems with subsystems, On the Enumeration of One-Factorizations of Complete Graphs Containing Prescribed Automorphism Groups, Constraints for symmetry breaking in graph representation, Rank of adjacency matrices of directed (strongly) regular graphs, An orderly algorithm and some applications in finite geometry, Classification of three-class association schemes using backtracking with dynamic variable ordering, Generating Nonisomorphic Maps without Storing Them, The size distribution for Markov equivalence classes of acyclic digraph models., Linear time tree codes, Computers and discovery in algebraic graph theory, The number of nonisomorphic posets having 12 elements, On strong starters in cyclic groups, Boundary uniqueness of fusenes, The generation of random, binary unordered trees, Backtrack search for parallelisms of projective spaces
