Faradžev Read-type enumeration of non-isomorphic CC systems

DOI10.1016/J.COMGEO.2021.101770OpenAlexW3147047091MaRDI QIDQ2230397FDOQ2230397

Authors Milan Banković, Filip Marić

Publication date 17 September 2021

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2021.101770

zbMATH Keywords

SAT solvingCC systemshomomorphism principlepoint triples orientationFaradžev-Read enumeration

Mathematics Subject Classification ID

Graph theory (05Cxx) Artificial intelligence (68Txx) Enumerative combinatorics (05Axx) Designs and configurations (05Bxx) Computing methodologies and applications (68Uxx)

Recommendations

• Complete enumeration of small realizable oriented matroids
• Enumerating order types for small point sets with applications
• Fast enumeration algorithms for non-crossing geometric graphs
• Enumerating order types for small sets with applications
• Counting and enumerating crossing-free geometric graphs

Cites work

• scientific article; zbMATH DE number 5510691 (Why is no real title available?)
• scientific article; zbMATH DE number 3639629 (Why is no real title available?)
• scientific article; zbMATH DE number 1182898 (Why is no real title available?)
• scientific article; zbMATH DE number 5493266 (Why is no real title available?)
• A SAT attack on the Erdős-Szekeres conjecture
• A machine program for theorem-proving
• A note on universal point sets for planar graphs
• Abstract order type extension and new results on the rectilinear crossing number
• Axioms and hulls
• Computer solution to the 17-point Erdős-Szekeres problem
• Enumerating order types for small point sets with applications
• Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
• Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points
• Generation of union-closed sets and Moore families
• Implementing efficient All solutions SAT solvers
• Multidimensional Sorting
• Nonrealizability proofs in computational geometry
• On halving line arrangements
• On the finding of final polynomials
• Reverse search for enumeration
• The complexity of theorem-proving procedures
• Two disjoint 5-holes in point sets
• Verifying Faradžev-Read Type Isomorph-Free Exhaustive Generation

Describes a project that uses

Uses Software

• Chaff
• PicoSAT

This page was built for publication: Faradžev Read-type enumeration of non-isomorphic CC systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2230397)