Sciweavers

99 search results - page 10 / 20
» Labeling planar graphs with a condition at distance two
Sort
View
WG
1998
Springer
15 years 2 months ago
Graphs with Bounded Induced Distance
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
Serafino Cicerone, Gabriele Di Stefano
ISCAS
2008
IEEE
136views Hardware» more  ISCAS 2008»
15 years 4 months ago
Spatial-temporal consistent labeling for multi-camera multi-object surveillance systems
Abstract—For an intelligent multi-camera multi-object surveillance system, object correspondence across time and space is important to many smart visual applications. In this pap...
Jing-Ying Chang, Tzu-Heng Wang, Shao-Yi Chien, Lia...
PODS
2004
ACM
96views Database» more  PODS 2004»
15 years 10 months ago
Roads, Codes and Spatiotemporal Queries
We present a novel coding-based technique for answering spatial and spatiotemporal queries on objects moving along a system of curves on the plane such as many road networks. We h...
Sandeep Gupta, Swastik Kopparty, Chinya V. Ravisha...
WG
2010
Springer
14 years 8 months ago
max-cut and Containment Relations in Graphs
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...
Marcin Kaminski
GG
2004
Springer
15 years 3 months ago
Towards Graph Programs for Graph Algorithms
Abstract. Graph programs as introduced by Habel and Plump [8] provide a simple yet computationally complete language for computing functions and relations on graphs. We extend this...
Detlef Plump, Sandra Steinert