3757 search results - page 235 / 752 » The overlap number of a graph |
176
click to vote
CSL
2008
Springer
15 years 8 months ago
2008
Springer
We study the logical definablity of the winning regions of parity games. For games with a bounded number of priorities, it is wellknown that the winning regions are definable in th...
144
click to vote
MP
2002
15 years 6 months ago
2002
The stability number (G) for a given graph G is the size of a maximum stable set in G. The Lov
170
click to vote
TPDS
1998
15 years 6 months ago
1998
—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...
177
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Reachability and distance computation are known to be NL-complete in general graphs, but within UL co-UL if the graphs are planar. However, finding longest paths is known to be N...
179
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
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...