2503 search results - page 229 / 501 » A study of 3-arc graphs |
160
click to vote
HM
2007
Springer
16 years 23 days ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
181
click to vote
SPAA
2006
ACM
16 years 17 days ago
2006
ACM
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
175
click to vote
SIGIR
2004
ACM
16 years 1 days ago
2004
ACM
Link Analysis has shown great potential in improving the performance of web search. PageRank and HITS are two of the most popular algorithms. Most of the existing link analysis al...
154
click to vote
ACISICIS
2005
IEEE
15 years 8 months ago
2005
IEEE
This paper introduces a strategy and its theory proof to transform non-linear concept graph: Directed Acyclic Concept Graph (DACG) into a linear concept tree. The transformation i...
159
click to vote
DCG
2010
15 years 6 months ago
2010
Consider a graph G with n vertices. In this paper we study geometric conditions for an n-tuple of points in Rd to admit a non-zero self stress with underlying graph G. We introduce...