3008 search results - page 130 / 602 » Independence in connected graphs |
161
click to vote
DAM
2007
15 years 6 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 ...
168
click to vote
SODA
2010
ACM
16 years 3 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...
200
click to vote
ISCC
2009
IEEE
16 years 1 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...
143
click to vote
ENVSOFT
2006
15 years 6 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...
151
click to vote
ACSC
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper examines QoS guarantees for bandwidth in mobile wireless networks, with a focus on reducing dropped connections on handoff. We can achieve this by reserving bandwidth f...