BibSonomy :: publication ::

tag user group author concept BibTeX key search:all search:diego_ma

The blue social bookmark and publication sharing system.

(0)

This publication has not been reviewed yet.

rating distribution

average user rating

The average rating is computed over all reviews. However, some of them may be invisible to you due to the visibility setting chosen by the reviewers.

(0.0 of 5.0 based on 0 reviews)

From Exact to Approximate Maximum Common Subgraph

by: Simone Marini, Michela Spagnuolo, and Bianca Falcidieno

In: Proc. Graph-Based Representations in Pattern Recognition GbRPR, Nr. 3434 (2005) , p. 263-272.

Resources (URL, PDF, PS...)

URL:	http://springerlink.metapress.com/openurl.asp?genre=article\&issn=0302-9743\&volume=3434\&spage=263

This paper presents an algorithm for the computation of the maximum common subgraph MCS between two directed, acyclic graphs with attributes. The core of the contribution resides in the modularity of the proposed algorithm which allows different heuristic techniques to be plugged in, depending on the application domain. Implemented heuristics for robust graph matching with respect to graph structural noise are discussed. As example of its effectiveness, the algortihm is applied to the problem of 3D shape similarity evaluation through structural shape descriptors.

BibTeX record

@inproceedings{Marini:2005,
  abstract = {This paper presents an algorithm for the computation of the maximum common subgraph (MCS) between two directed, acyclic graphs with attributes. The core of the contribution resides in the modularity of the proposed algorithm which allows different heuristic techniques to be plugged in, depending on the application domain. Implemented heuristics for robust graph matching with respect to graph structural noise are discussed. As example of its effectiveness, the algortihm is applied to the problem of 3D shape similarity evaluation through structural shape descriptors.},
  added-at = {2007-12-14T02:42:56.000+0100},
  author = {Marini, Simone and Spagnuolo, Michela and Falcidieno, Bianca},
  biburl = {http://www.bibsonomy.org/bibtex/2dabdecfb125d424336d794650ac3fb18/diego_ma},
  booktitle = {Proc. Graph-Based Representations in Pattern Recognition (GbRPR)},
  editor = {Brun, Luc and Vento, Mario},
  interhash = {bc9dc13120e534b0cd00f31c7fb443bc},
  intrahash = {dabdecfb125d424336d794650ac3fb18},
  keywords = {graphs},
  number = 3434,
  pages = {263-272},
  series = {LNCS},
  timestamp = {2007-12-14T02:42:56.000+0100},
  title = {From Exact to Approximate Maximum Common Subgraph},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article\&issn=0302-9743\&volume=3434\&spage=263},
  year = 2005
}

Endnote record

BibSonomy :: publication ::

From Exact to Approximate Maximum Common Subgraph

Resources (URL, PDF, PS...)

Abstract

BibTeX record

Endnote record