3757 search results - page 318 / 752 » The overlap number of a graph |
197
click to vote
GD
1998
Springer
15 years 11 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 ...
187
click to vote
CORR
2010
Springer
15 years 6 months 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...
216
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an i...
170
click to vote
DM
2008
15 years 6 months ago
2008
The chromatic capacity cap(G) of a graph G is the largest k for which there exists a k-coloring of the edges of G such that, for every coloring of the vertices of G with the same ...
175
click to vote
ALGORITHMICA
2006
15 years 6 months ago
2006
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...