Pages that link to "Item:Q4173359"
From MaRDI portal
The following pages link to Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations (Q4173359):
Displaying 50 items.
- Efficient enumeration of ordered trees with \(k\) leaves (Q441889) (← links)
- Matroid enumeration for incidence geometry (Q664549) (← links)
- Generating all finite modular lattices of a given size (Q745707) (← links)
- Linear time tree codes (Q799118) (← links)
- Quasi-symmetric designs on 56 points (Q825929) (← links)
- New parallelisms of \(\operatorname{PG}(3,5)\) with automorphisms of order 8 (Q832002) (← links)
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation (Q860396) (← links)
- Sets in Abelian groups with distinct sums of pairs. (Q868904) (← links)
- Orderly algorithm to enumerate central groupoids and their graphs (Q884884) (← links)
- On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847) (← links)
- On the classification of APN functions up to dimension five (Q1009090) (← links)
- Classification of simple 2-(11,3,3) designs (Q1011489) (← links)
- Integral point sets over \(\mathbb Z_n^m\) (Q1026112) (← links)
- Isomorphism-free lexicographic enumeration of triangulated surfaces and 3-manifolds (Q1041614) (← links)
- On strong starters in cyclic groups (Q1066268) (← links)
- The generation of random, binary unordered trees (Q1068492) (← links)
- On generating all maximal independent sets (Q1108809) (← links)
- Cataloguing general graphs by point and line spectra (Q1125186) (← links)
- Enumerations of rooted trees with an application to group presentations (Q1170253) (← links)
- Finding all closed sets: A general approach (Q1183948) (← links)
- The number of nonisomorphic posets having 12 elements (Q1314405) (← links)
- Generating all maximal independent sets on trees in lexicographic order (Q1328528) (← links)
- Sets in \(\mathbb{Z}_n\) with distinct sums of pairs. (Q1428557) (← links)
- Enumeration of balanced ternary designs. (Q1428560) (← links)
- An orderly algorithm and some applications in finite geometry (Q1584240) (← links)
- Boundary uniqueness of fusenes (Q1602690) (← links)
- On minimum sum representations for weighted voting games (Q1761826) (← links)
- Pick's inequality and tournaments (Q1801444) (← links)
- Miscellaneous classification results for 2-designs (Q1827673) (← links)
- The size distribution for Markov equivalence classes of acyclic digraph models. (Q1852851) (← links)
- Computers and discovery in algebraic graph theory (Q1855400) (← links)
- Dual-bounded generating problems: Weighted transversals of a hypergraph (Q1878396) (← links)
- Efficient exhaustive listings of reversible one dimensional cellular automata (Q1884849) (← links)
- Construction of discrete structures, especially isomers (Q1917329) (← links)
- Pruning the search tree in the constructive enumeration of molecular graphs (Q1917340) (← links)
- An algebraic representation of graphs and applications to graph enumeration (Q1953661) (← links)
- An exponential formula for polynomial vector fields. II: Lie series, exponential substitution, and rooted trees (Q1970021) (← links)
- On almost regular tournament matrices (Q1971038) (← links)
- Orderly generation of half regular symmetric designs via Rahilly families of pre-difference sets (Q1976883) (← links)
- Counting proper colourings in 4-regular graphs via the Potts model (Q1991414) (← links)
- Backtrack search for parallelisms of projective spaces (Q2115893) (← links)
- Faradžev Read-type enumeration of non-isomorphic CC systems (Q2230397) (← links)
- Biangular lines revisited (Q2230922) (← links)
- Tegula -- exploring a galaxy of two-dimensional periodic tilings (Q2243184) (← links)
- Constructions of maximum few-distance sets in Euclidean spaces (Q2290349) (← links)
- Structure of cubic Lehman matrices (Q2325755) (← links)
- Constraints for symmetry breaking in graph representation (Q2331101) (← links)
- Breaking symmetries in graph search with canonizing sets (Q2398437) (← links)
- Schur rings over the elementary abelian group of order 64 (Q2403642) (← links)
- Classification of some strongly regular subgraphs of the McLaughlin graph (Q2468023) (← links)
