Sciweavers

754 search results - page 113 / 151
» Exact Algorithms for the Vertex Separator Problem in Graphs
Sort
View
COCOON
2003
Springer
14 years 1 months ago
Graph Coloring and the Immersion Order
The relationship between graph coloring and the immersion order is considered. Vertex connectivity, edge connectivity and related issues are explored. These lead to the conjecture...
Faisal N. Abu-Khzam, Michael A. Langston
CDC
2008
IEEE
14 years 3 months ago
Passivity-based output synchronization and flocking algorithm in SE(3)
Abstract— This paper addresses passivity-based output synchronization and a collision avoidance problem of rigid bodies in the Special Euclidean group SE(3) under the assumption ...
Yuji Igarashi, Takeshi Hatanaka, Masayuki Fujita, ...
IAT
2009
IEEE
13 years 11 months ago
Developing a Deterministic Patrolling Strategy for Security Agents
Abstract—Developing autonomous systems that patrol environments for detecting intruders is a topic of increasing relevance in security applications. An important aspect of these ...
Nicola Basilico, Nicola Gatti, Francesco Amigoni
COCOON
2008
Springer
13 years 10 months ago
Approximating the Generalized Capacitated Tree-Routing Problem
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
Ehab Morsy, Hiroshi Nagamochi
SIAMDM
2010
194views more  SIAMDM 2010»
13 years 3 months ago
Combinatorics and Geometry of Finite and Infinite Squaregraphs
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
Hans-Jürgen Bandelt, Victor Chepoi, David Epp...