Learning Minor Closed Graph Classes with Membership and Equivalence Queries


Domingo, Carlos, Shawe-Taylor, John, Bodlaender, Hans and Abello, James (1994) Learning Minor Closed Graph Classes with Membership and Equivalence Queries.

Download

[img] PDF
Download (183Kb)

Description/Abstract

The paper considers the problem of learning classes of graphs closed under taking minors. It is shown that any such class can be properly learned in polynomial time using membership and equivalence queries. The representation of the class is in terms of a set of minimal excluded minors (obstruction set).

Item Type: Monograph (Technical Report)
Divisions: Faculty of Physical Sciences and Engineering > Electronics and Computer Science
ePrint ID: 259758
Date Deposited: 12 Aug 2004
Last Modified: 27 Mar 2014 20:02
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/259758

Actions (login required)

View Item View Item

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics