175 search results - page 9 / 35 » max-cut and Containment Relations in Graphs |
JCT
2008
13 years 8 months ago
2008
We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-Pfaffian graphs minimal with respect to the matching minor relation. This is in sha...
ICML
1996
IEEE
14 years 9 months ago
1996
IEEE
In this paper, we describe two di erent learning tasks for relational structures. When learning a classi er for structures, the relational structures in the training sets are clas...
JSYML
2007
13 years 8 months ago
2007
We consider embeddings of structures which preserve spectra: if g : M → S with S computable, then M should have the same Turing degree spectrum (as a structure) that g(M) has (a...
JGT
2006
13 years 8 months ago
2006
It is well known that every bipartite graph with vertex classes of size n whose minimum degree is at least n/2 contains a perfect matching. We prove an analogue of this result for...
AAAI
2007
13 years 11 months ago
2007
Symmetry is a widespread phenomenon that can offer opportunities for powerful exploitation in areas as diverse as molecular chemistry, pure mathematics, circuit design, biology an...