2002 AComparisonofAlgorithmsforMaxim

• (Bunke et al., 2002) ⇒ Horst Bunke, Pasquale Foggia, Corrado Guidobaldi, Carlo Sansone, and Mario Vento. (2002). “A Comparison of Algorithms for Maximum Common Subgraph on Randomly Connected Graphs.” In: Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition. ISBN:ISBN:3-540-44011-9 doi:https://doi.org/10.1007/3-540-70659-3_12

Subject Headings: Maximum Common Subgraph; Maximum Common Subgraph Algorithm; Maximum Common Subgraph Task; Maximum Common Subgraph System

Cited By

• http://scholar.google.com/scholar?q=%222002%22+A+Comparison+of+Algorithms+for+Maximum+Common+Subgraph+on+Randomly+Connected+Graphs
• http://dl.acm.org/citation.cfm?id=645890.671097&preflayout=flat#citedby

Quotes

Abstract

A graph [math]\displaystyle{ g }[/math] is called a maximum common subgraph of two graphs, [math]\displaystyle{ g_1 }[/math] and [math]\displaystyle{ g_2 }[/math], if there exists no other common subgraph of [math]\displaystyle{ g_1 }[/math] and [math]\displaystyle{ g_2 }[/math] that has more nodes than [math]\displaystyle{ g }[/math]. For the maximum common subgraph problem, exact and inexact algorithms are known from the literature. Nevertheless, until now no effort has been done for characterizing their performance. In this paper, two exact algorithms for maximum common subgraph detection are described. Moreover a database containing randomly connected pairs of graphs, having a maximum common graph of at least two nodes, is presented, and the performance of the two algorithms is evaluated on this database.

References

;

	Author	volume	Date Value	title	type	journal	titleUrl	doi	note	year
2002 AComparisonofAlgorithmsforMaxim	Horst Bunke Pasquale Foggia Corrado Guidobaldi Carlo Sansone Mario Vento			A Comparison of Algorithms for Maximum Common Subgraph on Randomly Connected Graphs				https://doi.org/10.1007/3-540-70659-3_12		2002