6740 search results - page 993 / 1348 » An s -Hamiltonian Line Graph Problem |
202
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
200
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
Multigranular optical WDM network aims to reduce network cost by grouping multiple wavelengths and then switching those wavelengths together at waveband or fiber levels. To configu...
206
click to vote
WAOA
2005
Springer
16 years 9 days ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
188
click to vote
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
Abstract. This work addresses a class of total-variation based multilabeling problems over a spatially continuous image domain, where the data fidelity term can be any bounded fun...
197
Voted
DAM
2008
15 years 7 months ago
2008
For digraphs D and H, a mapping f : V (D)V (H) is a homomorphism of D to H if uv A(D) implies f(u)f(v) A(H). For a fixed directed or undirected graph H and an input graph D, the...