Sciweavers

543 search results - page 43 / 109
» A Multiagent Algorithm for Graph Partitioning
Sort
View
JGAA
2008
97views more  JGAA 2008»
13 years 8 months ago
Drawing Bipartite Graphs on Two Parallel Convex Curves
Let G be a bipartite graph, and let e, i be two parallel convex curves; we study the question about whether G admits a planar straight-line drawing such that the vertices of one p...
Emilio Di Giacomo, Luca Grilli, Giuseppe Liotta
CORR
2007
Springer
134views Education» more  CORR 2007»
13 years 8 months ago
A Partition-Based Relaxation For Steiner Trees
The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph ...
Jochen Könemann, David Pritchard, Kunlun Tan
CDC
2008
IEEE
121views Control Systems» more  CDC 2008»
14 years 2 months ago
Stability of a second order consensus algorithm with time delay
—In this paper, we investigate a second order consensus problem in a directed graph with non-uniform time delay. This problem arises naturally in real multi-agent systems such as...
Wen Yang, Andrea L. Bertozzi, Xiaofan Wang
GD
2008
Springer
13 years 9 months ago
An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges
Abstract. We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one...
J. Joseph Fowler, Carsten Gutwenger, Michael J&uum...
CDC
2008
IEEE
102views Control Systems» more  CDC 2008»
14 years 2 months ago
Area-constrained coverage optimization by robotic sensor networks
Abstract— This paper studies robotic sensor networks performing coverage optimization tasks with area constraints. The network coverage of the environment is a function of the ro...
Jorge Cortés