3068 search results - page 71 / 614 » Clustering with Multiple Graphs |
228
click to vote
FOCS
2010
IEEE
15 years 4 months ago
2010
IEEE
Let G be a directed edge-weighted graph and let P be a shortest path from s to t in G. The replacement paths problem asks to compute, for every edge e on P, the shortest s-to-t pat...
169
click to vote
ICCS
2004
Springer
16 years 21 hour ago
2004
Springer
This paper gives a theoretical framework for clustering a set of conceptual graphs characterized by sparse descriptions. The formed clusters are named in an intelligible manner thr...
355
click to vote
SDM
2011
SIAM
14 years 9 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
198
click to vote
SOFSEM
2007
Springer
16 years 23 days ago
2007
Springer
In this paper we deal with making drawings of clustered hierarchical graphs nicer. Given a planar graph G = (V, E) with an assignment of the vertices to horizontal layers, a plane ...
194
click to vote
WEA
2010
Springer
15 years 11 months ago
2010
Springer
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...