Sciweavers

3204 search results - page 124 / 641
» The Alcuin Number of a Graph
Sort
View
WG
2009
Springer
14 years 2 months ago
The Parameterized Complexity of Some Minimum Label Problems
We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property Π, and we are ask...
Michael R. Fellows, Jiong Guo, Iyad A. Kanj
MP
2002
48views more  MP 2002»
13 years 7 months ago
Maximum stable set formulations and heuristics based on continuous optimization
The stability number (G) for a given graph G is the size of a maximum stable set in G. The Lov
Samuel Burer, Renato D. C. Monteiro, Yin Zhang
TPDS
1998
110views more  TPDS 1998»
13 years 7 months ago
On Exploiting Task Duplication in Parallel Program Scheduling
—One of the main obstacles in obtaining high performance from message-passing multicomputer systems is the inevitable communication overhead which is incurred when tasks executin...
Ishfaq Ahmad, Yu-Kwong Kwok
APPML
2008
159views more  APPML 2008»
13 years 8 months ago
The rook problem on saw-toothed chessboards
A saw-toothed chessboard, or STC for short, is a kind of chessboard whose boundary forms two staircases from left down to right without any hole inside it. A rook at square (i, j)...
Hon-Chan Chen, Ting-Yem Ho
CVPR
2006
IEEE
14 years 10 months ago
Hierarchical Volumetric Multi-view Stereo Reconstruction of Manifold Surfaces based on Dual Graph Embedding
This paper presents a new volumetric stereo algorithm to reconstruct the 3D shape of an arbitrary object. Our method is based on finding the minimum cut in an octahedral graph str...
Alexander Hornung, Leif Kobbelt