Sciweavers

6740 search results - page 54 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
IBPRIA
2003
Springer
14 years 27 days ago
Segmentation of Curvilinear Objects Using a~Watershed-Based Curve Adjacency Graph
Abstract. This paper presents a general framework to segment curvilinear objects in 2D images. A pre-processing step relies on mathematical morphology to obtain a connected line wh...
Thierry Géraud
CORR
2010
Springer
106views Education» more  CORR 2010»
13 years 7 months ago
Lombardi Drawings of Graphs
We introduce the notion of Lombardi graph drawings, named after the abstract artist Mark Lombardi. In these drawings, edges are represented as circular arcs rather than as line seg...
Christian A. Duncan, David Eppstein, Michael T. Go...
DAM
2010
107views more  DAM 2010»
13 years 7 months ago
Codes from lattice and related graphs, and permutation decoding
Codes of length n2 and dimension 2n - 1 or 2n - 2 over the field Fp, for any prime p, that can be obtained from designs associated with the complete bipartite graph Kn,n and its l...
Jennifer D. Key, Bernardo Gabriel Rodrigues
MST
2006
99views more  MST 2006»
13 years 7 months ago
Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem
We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of...
Tobias Riege, Jörg Rothe
SODA
1997
ACM
169views Algorithms» more  SODA 1997»
13 years 9 months ago
Partial Matching of Planar Polylines Under Similarity Transformations
Given two planar polylines T and P with n and m edges, respectively, we present an Om2 n2  time, Omn space algorithm to nd portions of the text" T which are similar in sh...
Scott D. Cohen, Leonidas J. Guibas