245 search results - page 27 / 49 » Group connectivity of graphs with diameter at most 2 |
HICSS
2010
IEEE
14 years 2 months ago
2010
IEEE
Numerous recent papers have found important relationships between network structure and risks within networks. These results indicate that network structure can dramatically affec...
DAM
2008
13 years 7 months ago
2008
The NP-complete Closest 4-Leaf Power problem asks, given an undirected graph, whether it can be modified by at most r edge insertions or deletions such that it becomes a 4-leaf po...
ESA
2003
Springer
14 years 25 days ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
ALENEX
2007
13 years 9 months ago
2007
We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This a...
IWOCA
2009
Springer
14 years 2 months ago
2009
Springer
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...