A v-player whist tournament is a schedule of games, where in each round the v players are partitioned into games of four players each with at most one player left over. In each ga...
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 ...
Several emerging computer devices read bio-electrical signals (e.g., electro-corticographic signals, skin biopotential or facial muscle tension) and translate them into computer- ...
Abstract. This paper presents an algorithm for constructing a spanner for ad hoc networks whose nodes have variable transmission range. Almost all previous spanner constructions fo...
—Many dynamical processes can be represented as directed attributed graphs or Petri nets where relationships between various entities are explicitly expressed. Signaling networks...
Bahram Parvin, Nirmalya Ghosh, Laura Heiser, Merri...