1101 search results - page 46 / 221 » An Algorithm for the Graph Crossing Number Problem |
126
click to vote
ALGORITHMICA
2004
15 years 1 months ago
2004
We consider the Chromatic Sum Problem on bipartite graphs which appears to be much harder than the classical Chromatic Number Problem. We prove that the Chromatic Sum Problem is NP...
118
click to vote
CAAN
2007
Springer
15 years 8 months ago
2007
Springer
In the recently introduced model for cleaning a graph with brushes, we use a degree-greedy algorithm to clean a random d-regular graph on n vertices (with dn even). We then use a d...
115
click to vote
COR
2007
15 years 1 months ago
2007
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
144
click to vote
ATAL
2008
Springer
15 years 4 months ago
2008
Springer
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
124
click to vote
ICAC
2006
IEEE
15 years 8 months ago
2006
IEEE
— Over the past decade, wide-area distributed computing has emerged as a powerful computing paradigm. Virtual machines greatly simplify wide-area distributed computing ing the ab...