Reversible finite automata with halting states (RFA) were first considered by Ambainis and Freivalds to facilitate the research of KondacsWatrous quantum finite automata. In this ...
We determine the values of the acyclic chromatic index of a class of graphs referred to as d-dimensional partial tori. These are graphs which can be expressed as the cartesian prod...
Assume that each vertex of a graph G is assigned a constant number q of nonnegative integer weights, and that q pairs of nonnegative integers li and ui, 1 i q, are given. One wis...
: Inferring graphs from path frequency has been studied as an important problem which has a potential application to drug design and elucidation of chemical structures. Given a mul...
We present an efficient reduction mapping undirected graphs G with n = 2k vertices for integers k to tables of partially specified Boolean functions g : {0, 1}4k+1 {0, 1, } so tha...