Sciweavers

6740 search results - page 163 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
ICDAR
2009
IEEE
14 years 5 months ago
Text Lines and Snippets Extraction for 19th Century Handwriting Documents Layout Analysis
In this paper we propose a new approach to improve electronic editions of human science corpus, providing an efficient estimation of manuscripts pages structure. In any handwriti...
Vincent Malleron, Véronique Eglin, Hubert E...
DIS
2007
Springer
14 years 2 months ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono
DM
2010
131views more  DM 2010»
13 years 10 months ago
Planar graphs without adjacent cycles of length at most seven are 3-colorable
We prove that every planar graph in which no i-cycle is adjacent to a j-cycle whenever 3 i j 7 is 3-colorable and pose some related problems on the 3-colorability of planar grap...
Oleg V. Borodin, Mickaël Montassier, Andr&eac...
GC
2010
Springer
13 years 9 months ago
Star-Uniform Graphs
A star-factor of a graph is a spanning subgraph each of whose components is a star. A graph
Mikio Kano, Yunjian Wu, Qinglin Yu
DICTA
2003
13 years 11 months ago
Two-Level Image Segmentation Based on Region and Edge Integration
Abstract. This paper introduces a two-level approach for image segmentation based on region and edge integration. Edges are first detected in the original image using a combinatio...
Qing Wu, Yizhou Yu