91 search results - page 2 / 19 » Routing Flow Through a Strongly Connected Graph |
CCCG
2008
13 years 9 months ago
2008
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
TCAD
2008
13 years 7 months ago
2008
Given a set of pins and a set of obstacles on routing layers, a multilayer obstacle-avoiding rectilinear Steiner minimal tree (ML-OARSMT) connects these pins by rectilinear edges w...
VDA
2010
13 years 10 months ago
2010
While there have been intensive efforts in developing better 3D flow visualization techniques, little attention has been paid to the design of better user interfaces and more effe...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
—The Internet AS level topology, upon which BGP4 runs, plays a vital role in the analysis and study of the global routing behavior. However, the study of the topology itself is n...
CACM
1999
13 years 7 months ago
1999
Onion Routing is an infrastructure for private communication over a public network. It provides anonymous connections that are strongly resistant to both eavesdropping and tra c a...