Sciweavers

1671 search results - page 60 / 335
» Hierarchical graph maps
Sort
View
SIROCCO
2007
13 years 10 months ago
Why Robots Need Maps
Abstract. A large group of autonomous, mobile entities e.g. robots initially placed at some arbitrary node of the graph has to jointly visit all nodes (not necessarily all edges) a...
Miroslaw Dynia, Jakub Lopuszanski, Christian Schin...
ISPD
2004
ACM
92views Hardware» more  ISPD 2004»
14 years 2 months ago
A predictive distributed congestion metric and its application to technology mapping
Due to increasing design complexity, routing congestion has become a critical problem in VLSI designs. This paper introduces a distributed metric to predict routing congestion for...
Rupesh S. Shelar, Sachin S. Sapatnekar, Prashant S...
IV
2007
IEEE
105views Visualization» more  IV 2007»
14 years 3 months ago
Mapping a Local Web Domain
In this study, we crawled a local Web domain, created its graph representation, and analyzed the network structure. The results of network analysis revealed local scalefree patter...
Weimao Ke, Tiago Simas
ICALP
1995
Springer
14 years 15 days ago
Intervalizing k-Colored Graphs
The problem to determine whether a given k-colored graph is a subgraph of a properly colored interval graph has an application in DNA physical mapping. In this paper, we study the...
Hans L. Bodlaender, Babette de Fluiter
CORR
2007
Springer
130views Education» more  CORR 2007»
13 years 9 months ago
On Computing the Distinguishing Numbers of Planar Graphs and Beyond: a Counting Approach
A vertex k-labeling of graph G is distinguishing if the only automorphism that preserves the labels of G is the identity map. The distinguishing number of G, D(G), is the smallest...
Vikraman Arvind, Christine T. Cheng, Nikhil R. Dev...