3204 search results - page 232 / 641 » The b-chromatic Number of a Graph |
94
Voted
ESA
2005
Springer
15 years 6 months ago
2005
Springer
We present an algorithm for finding shortest surface non-separating cycles in graphs embedded on surfaces in O(g3/2 V 3/2 log V + g5/2 V 1/2 ) time, where V is the number of vert...
95
Voted
MFCS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...
120
click to vote
SMA
2003
ACM
15 years 6 months ago
2003
ACM
In this paper a graph-based method is presented which not only characterizes topological classification of the tessellated surfaces but also simultaneously generates the substanti...
123
click to vote
GD
1998
Springer
15 years 4 months ago
1998
Springer
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
116
click to vote
CORR
2010
Springer
15 years 23 days ago
2010
Springer
This paper presents a new face identification system based on Graph Matching Technique on SIFT features extracted from face images. Although SIFT features have been successfully us...