6740 search results - page 395 / 1348 » An s -Hamiltonian Line Graph Problem |
156
click to vote
WADS
2009
Springer
15 years 11 months ago
2009
Springer
We present the first thorough theoretical analysis of the Transitivity Editing problem on digraphs. Herein, the task is to perform a minimum number of arc insertions or deletions ...
164
click to vote
TCAD
2008
15 years 4 months ago
2008
Given a set of pins and a set of obstacles on routing layers, a multilayer obstacle-avoiding rectilinear Steiner minimal tree (ML-OARSMT) connects these pins by rectilinear edges w...
146
click to vote
ICPR
2000
IEEE
16 years 5 months ago
2000
IEEE
We propose an algorithm to find piecewise linear skeletons of hand-written characters by using principal curves. The development of the method was inspired by the apparent similar...
173
click to vote
ECCV
2002
Springer
16 years 6 months ago
2002
Springer
We address the problem of computing the 3-dimensional shape of an arbitrary scene from a set of images taken at known viewpoints. Multi-camera scene reconstruction is a natural gen...
144
click to vote
ESA
2006
Springer
15 years 8 months ago
2006
Springer
We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex v is associated with a penalty rejection cost rv. We need to choos...