Sciweavers

656 search results - page 66 / 132
» Graph Theoretical Characterization and Computation of Answer...
Sort
View
IWPEC
2010
Springer
14 years 9 months ago
On the Kernelization Complexity of Colorful Motifs
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Ch...
WG
2010
Springer
14 years 10 months ago
Network Exploration by Silent and Oblivious Robots
In this paper we investigate the basic problem of Exploration of a graph by a group of identical mobile computational entities, called robots, operating autonomously and asynchrono...
Jérémie Chalopin, Paola Flocchini, B...
GD
2004
Springer
15 years 5 months ago
No-Three-in-Line-in-3D
The no-three-in-line problem, introduced by Dudeney in 1917, asks for the maximum number of points in the n × n grid with no three points collinear. In 1951, Erd¨os proved that t...
Attila Pór, David R. Wood
GI
2007
Springer
15 years 5 months ago
Potentials and Requirements of Mobile Ubiquitous Computing for Public Transport
: Public transport plays an important role in our society which is characterized by mobility, individuality, comfort and ecological constraints. It is common opinion that public tr...
Holger Mügge, Karl-Heinz Lüke, Matthias ...
SIAMJO
2010
79views more  SIAMJO 2010»
14 years 10 months ago
Theta Bodies for Polynomial Ideals
Inspired by a question of Lov´asz, we introduce a hierarchy of nested semidefinite relaxations of the convex hull of real solutions to an arbitrary polynomial ideal, called theta...
João Gouveia, Pablo A. Parrilo, Rekha R. Th...