Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
The Pathfinder algorithm is widely used to prune social networks. The pruning maintains the geodesic distances between nodes. It has shown itself to be very useful in the analysis...
Vicente P. Guerrero Bote, Felipe Zapico-Alonso, Ma...
We propose a hierarchical optical path network design algorithm. In order to efficiently accommodate wavelength paths in each waveband path, we define a source-destination Cartesia...
: In this paper we propose a new approach to Swarm Intelligence called Two-Step Swarm Intelligence. The basic idea is to split the heuristic search performed by agents into two sta...
We develop a queueing model for analyzing resource replication strategies in wireless sensor networks. The model can be used to minimize either the total transmission rate of the ...
Christopher R. Mann, Rusty O. Baldwin, Jeffrey P. ...