4926 search results - page 72 / 986 » Two Graph Algorithms On an Associative Computing Model |
FOCS
2003
IEEE
14 years 1 months ago
2003
IEEE
We show that random graphs in the preferential connectivity model have constant conductance, and hence have worst-case routing congestion that scales logarithmically with the numb...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
AUSAI
2003
Springer
14 years 29 days ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
EVOW
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of an algorithm. Moreover, o...