166 search results - page 11 / 34 » Partitioning Graphs to Speed Up Dijkstra's Algorithm |
BMCBI
2010
13 years 7 months ago
2010
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
KDD
2012
ACM
11 years 10 months ago
2012
ACM
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...
PAMI
2007
13 years 7 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
JGAA
2008
13 years 7 months ago
2008
Bar k-visibility graphs are graphs admitting a representation in which the vertices correspond to horizontal line segments, called bars, and the edges correspond to vertical lines...
ICDCS
2007
IEEE
14 years 2 months ago
2007
IEEE
This paper proposes a methodology for designing a class of algorithms for computing functions in dynamic distributed systems in which communication channels and processes may ceas...