1883 search results - page 66 / 377 » Ordered theta graphs |
IPL
2008
13 years 7 months ago
2008
A homomorphism from an oriented graph G to an oriented graph H is an arc-preserving mapping f from V(G) to V(H), that is f(x)f(y) is an arc in H whenever xy is an arc in G. The or...
JAPLL
2008
13 years 7 months ago
2008
A circle graph is the intersection graph of a set of chords of a circle. If a circle graph is prime for the split (or join) decomposition defined by Cunnigham, it has a unique rep...
IPL
2000
13 years 7 months ago
2000
In this paper we study the performance of a particular on-line coloring algorithm, the First-Fit or Greedy algorithm, on a class of perfect graphs namely the permutation graphs. W...
COMBINATORICS
1998
13 years 7 months ago
1998
Voltage graphs are a powerful tool for constructing large graphs (called lifts) with prescribed properties as covering spaces of small base graphs. This makes them suitable for ap...
ICIP
2005
IEEE
14 years 9 months ago
2005
IEEE
In this paper, we investigate the use of discriminant techniques in the elastic graph matching (EGM) algorithm. First we use discriminant analysis in the feature vectors of the no...