Sciweavers

199 search results - page 6 / 40
» Recognizing HHDS-Free Graphs
Sort
View
EJC
1998
13 years 9 months ago
A Convexity Lemma and Expansion Procedures for Bipartite Graphs
A hierarchy of classes of graphs is proposed which includes hypercubes, acyclic cubical complexes, median graphs, almost median graphs, premedian graphs and partial cubes. Structu...
Wilfried Imrich, Sandi Klavzar
DM
2007
98views more  DM 2007»
13 years 9 months ago
Fast recognition of classes of almost-median graphs
In this paper it is shown that a class of almost-median graphs that includes all planar almost-median graphs can be recognized in O(m log n) time, where n denotes the number of ve...
Wilfried Imrich, Alenka Lipovec, Iztok Peterin, Pe...
ISAAC
2010
Springer
268views Algorithms» more  ISAAC 2010»
13 years 7 months ago
On the Intersection of Tolerance and Cocomparability Graphs
It has been conjectured by Golumbic and Monma in 1984 that the intersection of tolerance and cocomparability graphs coincides with bounded tolerance graphs. Since cocomparability g...
George B. Mertzios, Shmuel Zaks
ICDAR
2009
IEEE
13 years 7 months ago
A Unified Framework for Recognizing Handwritten Chemical Expressions
Chemical expressions have more variant structures in 2-D space than that in math equations. In this paper we propose a unified framework for recognizing handwritten chemical expre...
Ming Chang, Shi Han, Dongmei Zhang
PRL
2002
91views more  PRL 2002»
13 years 9 months ago
StrCombo: combination of string recognizers
In this paper, we contribute a new paradigm of combining string recognizers and propose generic frameworks for hierarchical and parallel combination of multiple string recognizers...
Xiangyun Ye, Mohamed Cheriet, Ching Y. Suen