3267 search results - page 47 / 654 » Generalized quasirandom graphs |
96
Voted
DM
2002
15 years 15 days ago
2002
A generalized p-cycle is a digraph whose set of vertices can be partitioned into p parts that are cyclically ordered in such a way that the vertices in one part are adjacent only ...
WADS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
121
Voted
GLOBECOM
2007
IEEE
15 years 7 months ago
2007
IEEE
Abstract— Network tomography infers internal network characteristics by sending and collecting probe packets from the network edge. Traditional tomographic techniques for general...
77
Voted
SIAMDM
2008
15 years 18 days ago
2008
The Windy Postman Problem consists of finding a minimum cost traversal of all the edges of an undirected graph with two costs associated with each edge, representing the costs of ...
109
Voted
CCS
2009
ACM
16 years 1 months ago
2009
ACM
In this paper, we re-visit the problem of unconditionally secure message transmission (USMT) from a sender S to a receiver R, who are part of a distributed synchronous network, mo...