Abstract
Sometimes cases are represented as graphs of various brands — directed or undirected, labeled or not, belonging to special subclasses like planar or connected graphs. There exist already many graph matching procedures outside case-based reasoning. Some of them have been adapted to purposes of case retrieval.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Gebhardt, F., Voß, A., Gräther, W., Schmidt-Belz, B. (1997). Graphs. In: Reasoning with Complex Cases. The Springer International Series in Engineering and Computer Science, vol 393. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-6233-7_7
Download citation
DOI: https://doi.org/10.1007/978-1-4615-6233-7_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7859-4
Online ISBN: 978-1-4615-6233-7
eBook Packages: Springer Book Archive