1605 search results - page 78 / 321 » On Partitional Labelings of Graphs |
NETWORKS
2010
13 years 8 months ago
2010
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
STOC
2006
ACM
14 years 10 months ago
2006
ACM
Classes of graphs with bounded expansion have been introduced in [15], [12]. They generalize both proper minor closed classes and classes with bounded degree. For any class with b...
SIES
2007
IEEE
14 years 3 months ago
2007
IEEE
— The research field of partitioning for electronic systems started to attract significant attention of scientists about fifteen years ago. Gaining ever more importance due to...
ICNP
2005
IEEE
14 years 3 months ago
2005
IEEE
In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node failure affec...
SIROCCO
2008
13 years 11 months ago
2008
We consider a network represented by a simple connected undirected graph with N anonymous nodes that have local orientations, i.e. incident edges of each vertex have locally-unique...