422 search results - page 58 / 85 » Shortest paths between shortest paths and independent sets |
BMCBI
2007
13 years 8 months ago
2007
Background: A number of studies on biological networks have been carried out to unravel the topological characteristics that can explain the functional importance of network nodes...
CICLING
2009
Springer
13 years 6 months ago
2009
Springer
Abstract. Previous work has shown that modeling relationships between articles of a regulation as vertices of a graph network works twice as better than traditional information ret...
GIS
2002
ACM
13 years 8 months ago
2002
ACM
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...
OPODIS
2008
13 years 10 months ago
2008
Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between a...
SDM
2012
SIAM
11 years 11 months ago
2012
SIAM
Network-analysis literature is rich in node-centrality measures that quantify the centrality of a node as a function of the (shortest) paths of the network that go through it. Exi...