Sciweavers

56 search results - page 1 / 12
» Holes in Graphs
Sort
View
ICCSA
2004
Springer
13 years 10 months ago
Searching for 2D Spatial Network Holes
Research involving different forms of networks, such as internet networks, social networks, and cellular networks, has increasingly become an important field of study. From this wo...
Femke Reitsma, Shane Engel
ALGORITHMICA
2006
103views more  ALGORITHMICA 2006»
13 years 4 months ago
Recognizing Hole-Free 4-Map Graphs in Cubic Time
We present a cubic-time algorithm for the following problem: Given a simple graph, decide whether it is realized by adjacencies of countries in a map without holes, in which at mo...
Zhi-Zhong Chen, Michelangelo Grigni, Christos H. P...
LCN
2007
IEEE
13 years 10 months ago
Detecting Black Hole Attacks in Tactical MANETs using Topology Graphs
Abstract— Black Hole Attacks are a serious threat to communication in tactical MANETs. In this work we present TOGBAD a new centralised approach, using topology graphs to identif...
Elmar Gerhards-Padilla, Nils Aschenbruck, Peter Ma...
DIALM
2005
ACM
203views Algorithms» more  DIALM 2005»
13 years 6 months ago
Topological hole detection in wireless sensor networks and its applications
The identification of holes in a wireless sensor network is of primary interest since the breakdown of sensor nodes in a larger area often indicates one of the special events to ...
Stefan Funke
ALGORITHMICA
2007
86views more  ALGORITHMICA 2007»
13 years 4 months ago
Detecting Holes and Antiholes in Graphs
In this paper we study the problems of detecting holes and antiholes in general undirected graphs, and we present algorithms for these problems. For an input graph G on n vertices ...
Stavros D. Nikolopoulos, Leonidas Palios