1629 search results - page 54 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
SPAA
2009
ACM
15 years 4 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...
ECCV
2006
Springer
15 years 11 months ago
2006
Springer
Algorithms for discrete energy minimization play a fundamental role for low-level vision. Known techniques include graph cuts, belief propagation (BP) and recently introduced tree-...
INFOCOM
2002
IEEE
15 years 2 months ago
2002
IEEE
— Recent work has shown that the node degree in the WWW induced graph and the AS-level Internet topology exhibit power laws. Since then several algorithms have been proposed to g...
MOBICOM
2012
ACM
13 years 8 days 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...