2125 search results - page 83 / 425 » On Graph Complexity |
141
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
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...
186
click to vote
CIAC
2010
Springer
15 years 9 months ago
2010
Springer
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...
133
click to vote
EUROPAR
2007
Springer
16 years 14 days ago
2007
Springer
We present in detail a GCA (Global Cellular Automaton) algorithm with 3n cells for Hirschberg’s algorithm which determines the connected components of a n-node undirected graph w...
188
click to vote
ICFCA
2004
Springer
15 years 11 months ago
2004
Springer
Traditional logic can be understood as the investigation of the three main essential functions of thinking – concepts, judgements and conclusions. In the last years, in a new res...
154
click to vote
GBRPR
2009
Springer
15 years 11 months ago
2009
Springer
The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Ne...