1605 search results - page 90 / 321 » On Partitional Labelings of Graphs |
TON
2008
13 years 9 months ago
2008
Abstract--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 fail...
CGF
1999
13 years 9 months ago
1999
We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to...
IPPS
2007
IEEE
14 years 4 months ago
2007
IEEE
Software transactional memory systems enable a programmer to easily write concurrent data structures such as lists, trees, hashtables, and graphs, where non-conflicting operation...
ISAAC
2009
Springer
14 years 4 months ago
2009
Springer
Connected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite permutation graphs of n vertices is given. Based on the num...
EOR
2006
13 years 9 months ago
2006
The problem of routing and wavelength assignment in all-optical networks may be solved by a combined approach involving the computation of alternative routes for the lightpaths, f...