376 search results - page 31 / 76 » Completely connected clustered graphs |
WG
2005
Springer
14 years 1 months ago
2005
Springer
The NP-complete Closest 4-Leaf Power problem asks, given an undirected graph, whether it can be modified by at most edge insertions or deletions such that it becomes a 4-leaf powe...
ICDCS
2002
IEEE
14 years 20 days ago
2002
IEEE
Abstract—We propose a new geometric spanner for wireless ad hoc networks, which can be constructed efficiently in a distributed manner. It integrates the connected dominating se...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
d Abstract) Noga Alon∗ Fedor V. Fomin† Gregory Gutin‡ Michael Krivelevich§ Saket Saurabh¶ We prove that finding a rooted subtree with at least k leaves in a directed grap...
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
Community detection is an important task for mining the structure and function of complex networks. Generally, there are several different kinds of nodes in a network which are c...
ISBI
2011
IEEE
12 years 11 months ago
2011
IEEE
High angular resolution diffusion imaging (HARDI) allows in vivo analysis of the white matter structure and connectivity. Based on orientation distribution functions (ODFs) that r...