2069 search results - page 217 / 414 » Linear time algorithms for Clobber |
194
click to vote
ICCS
2004
Springer
15 years 12 months ago
2004
Springer
In the present paper routing and wavelength assignment (RWA) in optical WDM networks is discussed. Previous techniques on based on the integer linear programming and graph coloring...
181
click to vote
ISAAC
2004
Springer
15 years 12 months ago
2004
Springer
We study Pareto optimal matchings in the context of house allocation problems. We present an O( √ nm) algorithm, based on Gale’s Top Trading Cycles Method, for finding a maxim...
160
click to vote
TODS
2002
15 years 6 months ago
2002
g for Dependencies at Multiple Abstraction Levels Toon Calders Raymond T. Ng Jef Wijsen The notion of roll-up dependency (RUD) extends functional dependencies with generalization ...
157
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved eff...
184
click to vote
IJAR
2010
15 years 5 months ago
2010
Probabilistic Decision Graphs (PDGs) are a class of graphical models that can naturally encode some context specific independencies that cannot always be efficiently captured by...