332 search results - page 5 / 67 » Complexity analysis of a decentralised graph colouring algor... |
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
MOBICOM
2012
ACM
11 years 10 months ago
2012
ACM
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
ICDAR
2009
IEEE
13 years 5 months ago
2009
IEEE
Text within a camera grabbed image can contain a huge amount of meta data about that scene. Such meta data can be useful for identification, indexing and retrieval purposes. Detec...
ICDM
2007
IEEE
14 years 1 months ago
2007
IEEE
Complex networks have been used successfully in scientific disciplines ranging from sociology to microbiology to describe systems of interacting units. Until recently, studies of...
SAS
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...