Sciweavers

776 search results - page 47 / 156
» Network Applications of Graph Bisimulation
Sort
View
JPDC
2006
134views more  JPDC 2006»
13 years 10 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong

Publication
295views
12 years 8 months ago
The Age of Analog Networks.
A large class of systems of biological and technological relevance can be described as analog networks, that is, collections of dynamic devices interconnected by links of varying s...
Claudio Mattiussi, Daniel Marbach, Peter Dürr, Da...
CORR
2010
Springer
167views Education» more  CORR 2010»
13 years 7 months ago
Compressive Sensing over Graphs
In this paper, motivated by network inference and tomography applications, we study the problem of compressive sensing for sparse signal vectors over graphs. In particular, we are ...
Weiyu Xu, Enrique Mallada, Ao Tang
GD
2005
Springer
14 years 3 months ago
A Hybrid Model for Drawing Dynamic and Evolving Graphs
Dynamic processes frequently occur in many applications. Visualizations of dynamically evolving data, for example as part of the data analysis, are typically restricted to a cumula...
Marco Gaertler, Dorothea Wagner
SIGMOD
2010
ACM
255views Database» more  SIGMOD 2010»
14 years 2 months ago
Large graph processing in the cloud
As the study of graphs, such as web and social graphs, becomes increasingly popular, the requirements of efficiency and programming flexibility of large graph processing tasks c...
Rishan Chen, Xuetian Weng, Bingsheng He, Mao Yang