Sciweavers

620 search results - page 63 / 124
» The edge-flipping group of a graph
Sort
View
CDC
2008
IEEE
183views Control Systems» more  CDC 2008»
13 years 9 months ago
Stabilization of infinitesimally rigid formations of multi-robot networks
This paper proposes a local gradient control law to stabilize a group of robots to a target formation. The control is derived from a potential function based on an undirected infin...
Laura Krick, Mireille E. Broucke, Bruce A. Francis
DM
2007
59views more  DM 2007»
13 years 8 months ago
Non-existence of nonorientable regular embeddings of n-dimensional cubes
By a regular embedding of a graph K into a surface we mean a 2-cell embedding of K into a compact connected surface with the automorphism group acting regularly on flags. Regular...
Young Soo Kwon, Roman Nedela
COCO
2009
Springer
105views Algorithms» more  COCO 2009»
14 years 3 months ago
Planar Graph Isomorphism is in Log-Space
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Th...
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
14 years 2 months ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
ASUNAM
2009
IEEE
14 years 2 months ago
Mining the Dynamics of Music Preferences from a Social Networking Site
In this paper we present an application of our incremental graph clustering algorithm (DENGRAPH) on a data set obtained from the music community site Last.fm. The aim of our study...
Nico Schlitter, Tanja Falkowski