1986 search results - page 205 / 398 » Path Separability of Graphs |
104
click to vote
WETICE
1996
IEEE
15 years 6 months ago
1996
IEEE
The Multi-Head, Multi-Tail, Multi-Client (MMM) Browsing Project is a continuing effort to bring stronger graph semantics to the World Wide Web thereby increasing the Web's us...
116
click to vote
SODA
1990
ACM
15 years 3 months ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
115
click to vote
INFOCOM
2005
IEEE
15 years 8 months ago
2005
IEEE
Abstract— The distributed hash table (DHT) scheme has become the core component of many large-scale peer-to-peer networks. Degree, diameter, and congestion are important measures...
129
click to vote
DASFAA
2010
IEEE
15 years 7 months ago
2010
IEEE
Given a set of query points, a dynamic skyline query reports all data points that are not dominated by other data points according to the distances between data points and query po...
128
click to vote
COMPLEX
2009
Springer
15 years 6 months ago
2009
Springer
Studies of the Internet have typically focused either on the routing system, i.e. the paths chosen to reach a given destination, or on the evolution of traffic on a physical link. ...