4865 search results - page 149 / 973 » The Complexity of Graph Connectivity |
DAM
2007
13 years 10 months ago
2007
In this paper, we prove that the harmonious coloring problem is NP-complete for connected interval and permutation graphs. Given a simple graph G, a harmonious coloring of G is a ...
SODA
2010
ACM
14 years 8 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
ISCC
2009
IEEE
14 years 5 months ago
2009
IEEE
It is important to have continuous connectivity in a wireless sensor network after it is deployed in a hostile environment. However, such networks are constrained by the low usert...
INFOCOM
2007
IEEE
14 years 5 months ago
2007
IEEE
Abstract—We propose a novel algorithm for detecting wormhole attacks in wireless multi-hop networks. The algorithm uses only connectivity information to look for forbidden substr...
ENVSOFT
2006
13 years 10 months ago
2006
LQGraph implements methods for optimizing the connectivity of sites administered to protect biodiversity (a conservation area network). The methods are suitable for existing prote...