Sciweavers

632 search results - page 10 / 127
» On Routing in Circulant Graphs
Sort
View
ICCAD
1999
IEEE
90views Hardware» more  ICCAD 1999»
14 years 22 days ago
An implicit connection graph maze routing algorithm for ECO routing
Abstract-- ECO routing is a very important design capability in advanced IC, MCM and PCB designs when additional routings need to be made at the latter stage of the physical design...
Jason Cong, Jie Fang, Kei-Yong Khoo
MOBIHOC
2001
ACM
14 years 8 months ago
Geometric spanner for routing in mobile networks
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
Jie Gao, Leonidas J. Guibas, John Hershberger, Li ...
IROS
2006
IEEE
123views Robotics» more  IROS 2006»
14 years 2 months ago
Robot Navigation based on the Mapping of Coarse Qualitative Route Descriptions to Route Graphs
— This paper describes the use of natural language route descriptions in the mobile robot navigation domain. Guided by corpus analysis and earlier work on coarse qualitative rout...
Christian Mandel, Udo Frese, Thomas Röfer
CCR
2004
119views more  CCR 2004»
13 years 8 months ago
Collecting the internet AS-level topology
At the inter-domain level, the Internet topology can be represented by a graph with Autonomous Systems (ASes) as nodes and AS peerings as links. This AS-level topology graph has b...
Beichuan Zhang, Raymond A. Liu, Daniel Massey, Lix...
STACS
2007
Springer
14 years 2 months ago
Compact Forbidden-Set Routing
We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...
Bruno Courcelle, Andrew Twigg