Sciweavers

286 search results - page 2 / 58
» Recognition Algorithm for Diamond-Free Graphs
Sort
View
WG
2004
Springer
13 years 10 months ago
Treelike Comparability Graphs: Characterization, Recognition, and Applications
An undirected graph is a treelike comparability graph if it admits a transitive orientation such that its transitive reduction is a tree. We show that treelike comparability graphs...
Sabine Cornelsen, Gabriele Di Stefano
WG
2005
Springer
13 years 10 months ago
Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs
This paper considers the problem of maintaining a compact representation (O(n) space) of permutation graphs under vertex and edge modifications (insertion or deletion). That repr...
Christophe Crespelle, Christophe Paul
ICPR
2006
IEEE
14 years 6 months ago
An Efficient Radical-Based Algorithm for Stroke-Order-Free Online Kanji Character Recognition
This paper investigates improvements of an online handwriting stroke-order analysis algorithm -- cube search, based on cube graph stroke-order generation model and dynamic program...
Hiroaki Sakoe, Seiichi Uchida, Wenjie Cai
EMMCVPR
2001
Springer
13 years 9 months ago
Estimation of Distribution Algorithms: A New Evolutionary Computation Approach for Graph Matching Problems
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size ...
Endika Bengoetxea, Pedro Larrañaga, Isabell...
STACS
2010
Springer
13 years 12 months ago
The Recognition of Tolerance and Bounded Tolerance Graphs
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This subclass of perfect graphs has bee...
George B. Mertzios, Ignasi Sau, Shmuel Zaks