Sciweavers

1749 search results - page 221 / 350
» Conditional colorings of graphs
Sort
View
IJCAI
1993
15 years 8 months ago
Using Local Information in a Non-Local Way for Mapping Graph-Like Worlds
This paper describes a technique whereby an autonomous agent such as a mobile robot can explore an unknown environment and make a topologicalmapofit. It is assumedthat the environ...
Gregory Dudek, Paul Freedman, Souad Hadjres
WAW
2010
Springer
235views Algorithms» more  WAW 2010»
15 years 4 months ago
Multiplicative Attribute Graph Model of Real-World Networks
Large scale real-world network data such as social and information networks are ubiquitous. The study of such social and information networks seeks to find patterns and explain th...
Myunghwan Kim, Jure Leskovec
156
Voted
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
16 years 7 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani
IPPS
2007
IEEE
16 years 1 months ago
Minimum number of wavelengths equals load in a DAG without internal cycle
Let P be a family of dipaths. The load of an arc is the number of dipaths containing this arc. Let π(G, P) be the maximum of the load of all the arcs and let w(G, P) be the minim...
Jean-Claude Bermond, Michel Cosnard
IPSN
2005
Springer
16 years 6 days ago
Tracking on a graph
Abstract— This paper considers the problem of tracking objects with sparsely located binary sensors. Tracking with a sensor network is a challenging task due to the inaccuracy of...
Songhwai Oh, Shankar Sastry