Sciweavers

63 search results - page 10 / 13
» Remarks on the second neighborhood problem
Sort
View
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
15 years 1 months ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó
WOTE
2010
14 years 8 months ago
On Optical Mark-Sense Scanning
Optical mark-sense scanning has lead to a resurgence in the use of paper ballots in the United States, despite a century of strong competition from paperless direct-recording votin...
Douglas W. Jones
MFCS
2007
Springer
15 years 4 months ago
Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...
Paul S. Bonsma, Luis Cereceda
ECCV
2006
Springer
15 years 11 months ago
The Alignment Between 3-D Data and Articulated Shapes with Bending Surfaces
In this paper we address the problem of aligning 3-D data with articulated shapes. This problem resides at the core of many motion tracking methods with applications in human motio...
Guillaume Dewaele, Frederic Devernay, Radu Horaud,...
ANOR
2011
101views more  ANOR 2011»
14 years 4 months ago
The case for strategic oscillation
Hard problems for metaheuristic search can be a source of insight for developing better methods. We examine a challenging instance of such a problem that has exactly two local opt...
Fred Glover, Jin-Kao Hao