The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
Hans L. Bodlaender, Michael R. Fellows, Pinar Hegg...
In a wireless sensor network, short range multihop transmissions are preferred to prolong the network lifetime due to super-linear nature of energy consumption with communication d...
Dejun Yang, Satyajayant Misra, Xi Fang, Guoliang X...
Abstract: With today’s available computer power, free energy calculations from equilibrium molecular dynamics simulations “via counting” become feasible for an increasing num...
—In the Internet of the future, a flexible, dynamic combination of wireless and wired access networks is expected to be a key driver for enlarging the broadband communication se...
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...