Sciweavers

3958 search results - page 40 / 792
» Dynamic Graph Algorithms with Applications
Sort
View
149
Voted
ICST
2010
IEEE
15 years 14 days ago
GraphSeq: A Graph Matching Tool for the Extraction of Mobility Patterns
Mobile computing systems provide new challenges for verification. One of them is the dynamicity of the system structure, with mobility-induced connections and disconnections, dynam...
Minh Duc Nguyen, Hélène Waeselynck, ...
137
Voted
APPROX
2005
Springer
96views Algorithms» more  APPROX 2005»
15 years 8 months ago
Derandomized Squaring of Graphs
We introduce a “derandomized” analogue of graph squaring. This operation increases the connectivity of the graph (as measured by the second eigenvalue) almost as well as squar...
Eyal Rozenman, Salil P. Vadhan
120
Voted
SCAM
2006
IEEE
15 years 8 months ago
Constructing Accurate Application Call Graphs For Java To Model Library Callbacks
Call graphs are widely used to represent calling relationships among methods. However, there is not much interest in calling relationships among library methods in many software e...
Weilei Zhang, Barbara G. Ryder
148
Voted
CVPR
2012
IEEE
13 years 5 months ago
Group action induced distances for averaging and clustering Linear Dynamical Systems with applications to the analysis of dynami
We introduce a framework for defining a distance on the (non-Euclidean) space of Linear Dynamical Systems (LDSs). The proposed distance is induced by the action of the group of o...
Bijan Afsari, Rizwan Chaudhry, Avinash Ravichandra...
150
Voted
STOC
2006
ACM
186views Algorithms» more  STOC 2006»
16 years 2 months ago
A subset spanner for Planar graphs, : with application to subset TSP
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
Philip N. Klein