1480 search results - page 157 / 296 » Distributed algorithms for weighted problems in sparse graph... |
111
Voted
WDAG
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
118
Voted
PR
2008
15 years 5 days ago
2008
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
141
click to vote
FOSSACS
2009
Springer
15 years 7 months ago
2009
Springer
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
91
Voted
RECOMB
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We consider the problem of aligning two metabolic pathways. Unlike traditional approaches, we do not restrict the alignment to one-to-one mappings between the molecules o...
86
Voted
IPL
2008
15 years 20 days ago
2008
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...