Sciweavers

225 search results - page 17 / 45
» Stably Computable Properties of Network Graphs
Sort
View
ESANN
2006
14 years 11 months ago
Cluster detection algorithm in neural networks
Complex networks have received much attention in the last few years, and reveal global properties of interacting systems in domains like biology, social sciences and technology. O...
David Meunier, Hélène Paugam-Moisy
101
Voted
CPHYSICS
2006
124views more  CPHYSICS 2006»
14 years 9 months ago
Collision-free spatial hash functions for structural analysis of billion-vertex chemical bond networks
State-of-the-art molecular dynamics (MD) simulations generate massive datasets involving billion-vertex chemical bond networks, which makes data mining based on graph algorithms s...
Cheng Zhang, Bhupesh Bansal, Paulo S. Branicio, Ra...
GD
2008
Springer
14 years 10 months ago
Succinct Greedy Graph Drawing in the Hyperbolic Plane
We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so...
David Eppstein, Michael T. Goodrich
CONEXT
2009
ACM
14 years 10 months ago
Exploiting dynamicity in graph-based traffic analysis: techniques and applications
Network traffic can be represented by a Traffic Dispersion Graph (TDG) that contains an edge between two nodes that send a particular type of traffic (e.g., DNS) to one another. T...
Marios Iliofotou, Michalis Faloutsos, Michael Mitz...
IJWMC
2010
115views more  IJWMC 2010»
14 years 6 months ago
Small-world effects in wireless agent sensor networks
Coverage, fault tolerance and power consumption constraints make optimal placement of mobile sensors or other mobile agents a hard problem. We have developed a model for describin...
Kenneth A. Hawick, Heath A. James