Faradžev Read-type enumeration of non-isomorphic CC systems
From MaRDI portal
Publication:2230397
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
Recommendations
Graph theory (05Cxx) Artificial intelligence (68Txx) Enumerative combinatorics (05Axx) Designs and configurations (05Bxx) Computing methodologies and applications (68Uxx)
Cites Work
- Title not available (Why is that?)
- On the finding of final polynomials
- Title not available (Why is that?)
- The complexity of theorem-proving procedures
- Reverse search for enumeration
- A machine program for theorem-proving
- Computer solution to the 17-point Erdős-Szekeres problem
- Nonrealizability proofs in computational geometry
- Multidimensional Sorting
- Axioms and hulls
- Abstract order type extension and new results on the rectilinear crossing number
- Enumerating order types for small point sets with applications
- Title not available (Why is that?)
- On halving line arrangements
- 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
- Title not available (Why is that?)
- A SAT attack on the Erdős-Szekeres conjecture
- Two disjoint 5-holes in point sets
- A note on universal point sets for planar graphs
- Generation of Union Closed Sets and Moore families
- Verifying Faradžev-Read Type Isomorph-Free Exhaustive Generation
- Implementing Efficient All Solutions SAT Solvers
Uses Software
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)
