Sciweavers

5473 search results - page 680 / 1095
» On the graph isomorphism problem
Sort
View
INFOCOM
2007
IEEE
16 years 1 months ago
Modelling and Optimization of Stochastic Routing for Wireless Multi-Hop Networks
—We introduce a novel approach to multi-hop routing in wireless networks. Instead of the usual graph description we characterize the network by the packet delivery ratio matrix w...
Alejandro Ribeiro, Georgios B. Giannakis, Zhi-Quan...
IPPS
2007
IEEE
16 years 1 months ago
Advanced Shortest Paths Algorithms on a Massively-Multithreaded Architecture
We present a study of multithreaded implementations of Thorup’s algorithm for solving the Single Source Shortest Path (SSSP) problem for undirected graphs. Our implementations l...
Joseph R. Crobak, Jonathan W. Berry, Kamesh Maddur...
COCO
2007
Springer
93views Algorithms» more  COCO 2007»
16 years 1 months ago
S-T Connectivity on Digraphs with a Known Stationary Distribution
We present a deterministic logspace algorithm for solving S-T Connectivity on directed graphs if (i) we are given a stationary distribution of the random walk on the graph in whic...
Kai-Min Chung, Omer Reingold, Salil P. Vadhan
FASE
2007
Springer
16 years 29 days ago
Information Preserving Bidirectional Model Transformations
Abstract. Within model-driven software development, model transformation has become a key activity. It refers to a variety of operations modifying a model for various purposes such...
Hartmut Ehrig, Karsten Ehrig, Claudia Ermel, Frank...
MICAI
2007
Springer
16 years 28 days ago
Fuzzifying Clustering Algorithms: The Case Study of MajorClust
Among various document clustering algorithms that have been proposed so far, the most useful are those that automatically reveal the number of clusters and assign each target docum...
Eugene Levner, David Pinto, Paolo Rosso, David Alc...