Related papers: Approaching the Conway-99 problem using SAT solver…
The Boolean Satisfiability (SAT) problem stands out as an attractive NP-complete problem in theoretic computer science and plays a central role in a broad spectrum of computing-related applications. Exploiting and tuning SAT solvers under…
In this paper, we are concerned with geometric constraint solvers, i.e., with programs that find one or more solutions of a geometric constraint problem. If no solution exists, the solver is expected to announce that no solution has been…
We study a generalization of strongly regular graphs. We call a graph strongly walk-regular if there is an $\ell >1$ such that the number of walks of length $\ell$ from a vertex to another vertex depends only on whether the two vertices are…
We provide an abundance of strongly regular graphs (SRGs) for certain parameters $(n, k, \lambda, \mu)$ with $n < 100$. For this we use Godsil-McKay (GM) switching with a partition of type $4,n-4$ and Wang-Qiu-Hu (WQH) switching with a…
A strict confluent (SC) graph drawing is a drawing of a graph with vertices as points in the plane, where vertex adjacencies are represented not by individual curves but rather by unique smooth paths through a planar system of junctions and…
Generating diverse solutions to the Boolean Satisfiability Problem (SAT) is a hard computational problem with practical applications for testing and functional verification of software and hardware designs. We explore the way to generate…
We consider simple loopless finite undirected graphs. Such a graph is called strongly regular with parameter set (v,k,l,m), for short a srg(v,k,l,m), iff it has exactly v vertices, each of them has exactly k neighbours, and the number of…
The Cyclic Antibandwidth Problem (CABP), a variant of the Antibandwidth Problem, is an NP-hard graph labeling problem with numerous applications. Despite significant research efforts, existing state-of-the-art approaches for CABP are…
Solving point-wise feature correspondence in visual data is a fundamental problem in computer vision. A powerful model that addresses this challenge is to formulate it as graph matching, which entails solving a Quadratic Assignment Problem…
We consider the problem of exact and inexact matching of weighted undirected graphs, in which a bijective correspondence is sought to minimize a quadratic weight disagreement. This computationally challenging problem is often relaxed as a…
The one of the most interesting problem of discrete mathematics is the SAT (satisfiability) problem. Good way in SAT solver developing is to transform the SAT problem to the problem of continuous search of global minimums of the functional…
Anomaly detection is a crucial task in complex distributed systems. A thorough understanding of the requirements and challenges of anomaly detection is pivotal to the security of such systems, especially for real-world deployment. While…
Strongly regular graphs (SRGs) are highly symmetric combinatorial objects, with connections to many areas of mathematics including finite fields, finite geometries, and number theory. One can construct an SRG via the Cayley Graph of a…
A graph is $t$-tough if the deletion of any set of, say, $m$ vertices from the graph leaves a graph with at most $\frac{m}{t}$ components. In 1973, Chv\'{a}tal suggested the problem of relating toughness to factors in graphs. In 1985,…
The graph isomorphism problem is a main problem which has numerous applications in different fields. Thus, finding an efficient and easy to implement method to discriminate non-isomorphic graphs is valuable. In this paper, a new method is…
A typical result in graph theory says that a graph $G$, satisfying certain conditions, has some property $\cal P$. Once such a theorem is established, it is natural to ask how strongly $G$ satisfies $\cal P$. Can one strengthen the result…
In this paper we explore whether or not deep neural architectures can learn to classify Boolean satisfiability (SAT). We devote considerable time to discussing the theoretical properties of SAT. Then, we define a graph representation for…
Satisfiability is considered the canonical NP-complete problem and is used as a starting point for hardness reductions in theory, while in practice heuristic SAT solving algorithms can solve large-scale industrial SAT instances very…
In this article we demonstrate how to solve a variety of problems and puzzles using the built-in SAT solver of the computer algebra system Maple. Once the problems have been encoded into Boolean logic, solutions can be found (or shown to…
We propose a novel method using a quantum annealer -- an analog quantum computer based on the principles of quantum adiabatic evolution -- to solve the Graph Isomorphism problem, in which one has to determine whether two graphs are…