646 search results - page 91 / 130 » Generalized connected domination in graphs |
INFOCOM
2007
IEEE
14 years 3 months ago
2007
IEEE
Abstract— The Internet connectivity in the Autonomous System (AS) level reflects the commercial relationship between ASes. A connection between two ASes could be of type custome...
WWW
2009
ACM
14 years 9 months ago
2009
ACM
We demonstrate a flight meta-search engine that is based on the Metamorph framework. Metamorph provides mechanisms to model web forms together with the interactions which are need...
STOC
2009
ACM
14 years 9 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
SODA
2012
ACM
11 years 11 months ago
2012
ACM
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...
MOBICOM
2006
ACM
14 years 2 months ago
2006
ACM
It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in arbitrary undirected planar graphs. The purpose of this...