106 search results - page 1 / 22 » The skew spectrum of graphs |
ICML
2008
IEEE
14 years 5 months ago
2008
IEEE
The central issue in representing graphstructured data instances in learning algorithms is designing features which are invariant to permuting the numbering of the vertices. We pr...
DAM
2008
13 years 4 months ago
2008
We discuss some new and old results about skew partitions in perfect graphs.
GG
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labe...
JCT
2008
13 years 4 months ago
2008
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seym...
ISCAS
1994
IEEE
13 years 8 months ago
1994
IEEE
This paper addresses the problem of minimizing the clock period of a circuit by optimizingthe clock skews. We incorporate uncertainty factors and present a formulation that ensure...