847 search results - page 74 / 170 » Monitoring the connectivity of a grid |
GD
2008
Springer
13 years 10 months ago
2008
Springer
In this paper we present a generalization of the shift method algorithm [4, 6] to obtain a straight-line grid drawing of a triconnected graph, where vertex representations have a c...
DCG
2011
13 years 4 months ago
2011
We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by O(27.55n ) = O(18...
INTR
2007
13 years 8 months ago
2007
Purpose – This paper aims to look at a research project – StarPlane –a national dynamic photonic network controlled by grid applications. Design/methodology/approach – The...
JSW
2007
13 years 8 months ago
2007
— We propose a novel framework for building a distributed data acquisition and monitoring system. Our novel framework is mainly based on XML leverages and OPC (Openness, Producti...
SIGMOD
2009
ACM
14 years 9 months ago
2009
ACM
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...