677 search results - page 91 / 136 » Bipartite roots of graphs |
ESA
2009
Springer
15 years 6 months ago
2009
Springer
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
HPDC
1998
IEEE
15 years 4 months ago
1998
IEEE
Heterogeneous network-based systems are emerging as attractive computing platforms for HPC applications. This paper discusses fundamental research issues that must be addressed to...
105
click to vote
PLILP
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
108
click to vote
DAWAK
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Many real world applications rely on the discovery of maximal biclique subgraphs (complete bipartite subgraphs). However, existing algorithms for enumerating maximal bicl...
SODA
2008
ACM
15 years 1 months ago
2008
ACM
It is known that the dynamics of best response in an environment of non-cooperative users may converge to a good solution when users play sequentially, but may cycle far away from...