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...
Code-patterns are statically recurring structure specific to a programming language. It can be parallel to aid in designing software systems for solving particular problems. Contr...
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
—In this paper, we address the use of unified spatial relations for symbol description. We present a topologically guided directional relation signature. It references a unique ...
— In this paper, we study the performance of the 2-hop routing scheme proposed for ad hoc wireless networks with mobile nodes, considering realistic node mobility patterns. First...