Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
In the last decades, a large family of algorithms supervised or unsupervised; stemming from statistic or geometry theory have been proposed to provide different solutions to the p...
Java PathFinder (JPF) is a popular model checker for Java programs. JPF was used to generate object graphs as test inputs for object-oriented programs. Specifically, JPF was used...
Milos Gligoric, Tihomir Gvero, Steven Lauterburg, ...
The concept of safety vector can guide efficient fault-tolerant routing on interconnection networks. The safety vector on the hypercube is based on the distance of a pair of nodes...