646 search results - page 43 / 130 » Generalized connected domination in graphs |
SPAA
2005
ACM
14 years 2 months ago
2005
ACM
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
IPMU
2010
Springer
13 years 10 months ago
2010
Springer
We define and study the link prediction problem in bipartite networks, specializing general link prediction algorithms to the bipartite case. In a graph, a link prediction functio...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Orbits of graphs under local complementation (LC) and edge local complementation (ELC) have been studied in several different contexts. For instance, there are connections between...
FOCS
2006
IEEE
14 years 2 months ago
2006
IEEE
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
CCCG
2007
13 years 10 months ago
2007
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...