58 search results - page 9 / 12 » Connectivity keeping edges in graphs with large minimum degr... |
EDCC
2005
Springer
14 years 7 days ago
2005
Springer
Many governmental agencies and businesses organizations use networked systems to provide a number of services. Such a service-oriented network can be implemented as an overlay on ...
ICPP
1995
IEEE
13 years 10 months ago
1995
IEEE
– In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller gra...
WAW
2010
Springer
13 years 4 months ago
2010
Springer
Large scale real-world network data such as social and information networks are ubiquitous. The study of such social and information networks seeks to find patterns and explain th...
GLOBECOM
2006
IEEE
14 years 23 days ago
2006
IEEE
— While the Internet continues to thrive, the resiliency of its fundamental routing infrastructure is not fully understood. In this paper, we analyze the behavior of the de facto...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Let G = (V, E) be a graph. Let c : V → N be a vertex-coloring of the vertices of G. For any vertex u, we denote by N[u] its closed neighborhood (u and its adjacent vertices), an...