The longest common subsequence and sequence alignment problems have been studied extensively and they can be regarded as the relationship measurement between sequences. However, m...
We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems in several highly structured graph classes. For threshold graphs we give effic...
This paper deals with the existence and search of properly edgecolored paths/trails between two, not necessarily distinct, vertices s and t in an edge-colored graph from an algori...
A. Abouelaoualim, Kinkar Chandra Das, L. Faria, Ya...
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
—This article presents a novel mechanism to perform packet content inspection by longest prefix matching (LPM) technology. It is done by transforming the automaton-based state ta...