879 search results - page 93 / 176 » Designing Closer to the Edge |
IPPS
2009
IEEE
14 years 3 months ago
2009
IEEE
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
WADS
2005
Springer
14 years 2 months ago
2005
Springer
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
APPROX
2004
Springer
14 years 2 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
GG
2004
Springer
14 years 2 months ago
2004
Springer
Biochemical pathways, such as metabolic, regulatory, and signal transduction pathways, constitute complex networks of functional and physical interactions between molecular species...
PODC
2003
ACM
14 years 2 months ago
2003
ACM
This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tabl...