3958 search results - page 8 / 792 » Dynamic Graph Algorithms with Applications |
KDD
2008
ACM
15 years 10 months ago
2008
ACM
In this article we describe a visual-analytic tool for the interrogation of evolving interaction network data such as those found in social, bibliometric, WWW and biological appli...
SCAM
2006
IEEE
15 years 3 months ago
2006
IEEE
104
click to vote
KDD
2008
ACM
15 years 10 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
ISAAC
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
83
Voted
SIGECOM
2010
ACM
14 years 8 months ago
2010
ACM
We derive efficient algorithms for both detecting and representing matchings in lopsided bipartite graphs; such graphs have so many nodes on one side that it is infeasible to repr...