275 search results - page 47 / 55 » Bounding the Number of Edges in Permutation Graphs |
WADS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
DM
2007
13 years 7 months ago
2007
In this paper we deal with codes identifying sets of vertices in random networks; that is, (1, ≤ ℓ)-identifying codes. These codes enable us to detect sets of faulty processor...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
ATMOS
2010
13 years 6 months ago
2010
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...
IWDC
2005
Springer
14 years 26 days ago
2005
Springer
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The al...