301 search results - page 27 / 61 » On Finding Dense Subgraphs |
ARC
2007
Springer
15 years 1 months ago
2007
Springer
Many important algorithms in computational biology and related subjects rely on the ability to extract and to identify sub-graphs of larger graphs; an example is to find common fun...
124
Voted
CVPR
2010
IEEE
14 years 7 months ago
2010
IEEE
We investigate how to discover all common visual patterns within two sets of feature points. Common visual patterns generally share similar local features as well as similar spati...
101
click to vote
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
Complex networks capture interactions among entities in various application areas in a graph representation. Analyzing large scale complex networks often answers important question...
WG
2010
Springer
14 years 7 months ago
2010
Springer
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a directed path graph model (when possible). Moreover we extend this algorithm to fi...
SDM
2009
SIAM
15 years 6 months ago
2009
SIAM
The increasing availability of network data is creating a great potential for knowledge discovery from graph data. In many applications, feature vectors are given in addition to g...