Sciweavers

650 search results - page 14 / 130
» Positive graphs
Sort
View
81
Voted
STOC
2002
ACM
124views Algorithms» more  STOC 2002»
15 years 10 months ago
Clairvoyant scheduling of random walks
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
Péter Gács
FSTTCS
2003
Springer
15 years 2 months ago
Word Equations over Graph Products
For monoids that satisfy a weak cancellation condition, it is shown that the decidability of the existential theory of word equations is preserved under graph products. Furthermore...
Volker Diekert, Markus Lohrey
80
Voted
EDBT
2008
ACM
166views Database» more  EDBT 2008»
15 years 9 months ago
A novel spectral coding in a large graph database
Retrieving related graphs containing a query graph from a large graph database is a key issue in many graph-based applications, such as drug discovery and structural pattern recog...
Lei Zou, Lei Chen 0002, Jeffrey Xu Yu, Yansheng Lu
CIE
2010
Springer
15 years 2 months ago
Spatial Models for Virtual Networks
This paper discusses the use of spatial graph models for the analysis of networks that do not have a direct spatial reality, such as web graphs, on-line social networks, or citatio...
Jeannette Janssen
ICRA
2007
IEEE
140views Robotics» more  ICRA 2007»
15 years 3 months ago
On the Performance of Multi-robot Target Tracking
Abstract— In this paper, we study the accuracy of Cooperative Localization and Target Tracking (CLATT) in a team of mobile robots, and derive analytical upper bounds for the posi...
Faraz M. Mirzaei, Anastasios I. Mourikis, Stergios...