4009 search results - page 204 / 802 » Clustering on Complex Graphs |
139
click to vote
COCOON
2008
Springer
15 years 6 months ago
2008
Springer
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
171
click to vote
IRCDL
2010
15 years 5 months ago
2010
One of the most challenging issues in managing the large and diverse data available on the World Wide Web is the design of interactive systems to organize and represent information...
148
click to vote
BMCBI
2011
14 years 10 months ago
2011
Background: Standard graphs, where each edge links two nodes, have been extensively used to represent the connectivity of metabolic networks. It is based on this representation th...
154
click to vote
BIOCOMP
2008
15 years 5 months ago
2008
We introduce a novel parameter called container flux, which is used to measure the information sharing capacity between two distinct nodes in a graph. Other useful information, bot...
131
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...