Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaod...
Nowadays, searches for the web pages of a person with a given name constitute a notable fraction of queries to Web search engines. Such a query would normally return web pages rela...
Dmitri V. Kalashnikov, Zhaoqi Chen, Sharad Mehrotr...
We study the effects of physical layer parameters on the connectivity of fading wireless ad-hoc networks. Relying on a symbol error rate connectivity metric for wireless ad-hoc net...
We consider the isomorphism and canonization problem for 3-connected planar graphs. The problem was known to be L -hard and in UL ∩ coUL [TW08]. In this paper, we give a determin...
One of the key strengths of the region connection calculus (RCC) -- its generality -- is also one of its most important drawbacks for practical applications. The semantics of all ...
Steven Schockaert, Martine De Cock, Chris Cornelis...