Search Results

A General Tractable Density Concept for Graphs

Author: Faragó, András

Source: Mathematics in Computer Science, Volume 1, Number 4, June 2008 , pp. 689-699(11)

Publisher: Springer

Matching graphs by pivoting

Authors: Massaro A.; Pelillo M.

Source: Pattern Recognition Letters, Volume 24, Number 8, May 2003 , pp. 1099-1106(8)

Publisher: Elsevier

Comparison of chemical clustering methods using graph- and fingerprint-based similarity measures

Authors: Raymond J.W.; Blankley C.J.; Willett P.

Source: Journal of Molecular Graphics and Modelling, Volume 21, Number 5, March 2003 , pp. 421-433(13)

Publisher: Elsevier

Maximum common subgraph isomorphism algorithms for the matching of chemical structures

Authors: Raymond J.W.; Willett P.

Source: Journal of Computer-Aided Molecular Design, Volume 16, Number 7, July 2002 , pp. 521-533(13)

Publisher: Springer

RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs

Authors: Raymond J.W.; Gardiner E.J.

Source: Computer Journal, Volume 45, Number 6, 2002 , pp. 631-644(14)

Publisher: Oxford University Press

Effectiveness of graph-based and fingerprint-based similarity measures for virtual screening of 2D chemical structure databases

Authors: Raymond J.W.; Willett P.

Source: Journal of Computer-Aided Molecular Design, Volume 16, Number 1, January 2002 , pp. 59-71(13)

Publisher: Springer

A graph distance metric combining maximum common subgraph and minimum common supergraph

Authors: Fernandez M.-L.; Valiente G.

Source: Pattern Recognition Letters, Volume 22, Number 6, May 2001 , pp. 753-758(6)

Publisher: Elsevier

Graph distances using graph union

Authors: Wallis W.D.; Shoubridge P.; Kraetz M.; Ray D.

Source: Pattern Recognition Letters, Volume 22, Number 6, May 2001 , pp. 701-704(4)

Publisher: Elsevier

A Near Packing of Two Graphs

Author: Eaton N.

Source: Journal of Combinatorial Theory, Series B, Volume 80, Number 1, September 2000 , pp. 98-103(6)

Publisher: Elsevier

A Near Packing of Two Graphs

Author: Eaton N.

Source: Journal of Combinatorial Theory, Series B, Volume 80, Number 1, September 2000 , pp. 98-103(6)

Publisher: Academic Press

Identifying consensus of trees through alignment

Authors: Wang J.T.L.; Zhang K.

Source: Information Sciences, Volume 126, Number 1, July 2000 , pp. 165-189(25)

Publisher: Elsevier

Mean and maximum common subgraph of two graphs

Authors: Bunke H.; Kandel A.

Source: Pattern Recognition Letters, Volume 21, Number 2, February 2000 , pp. 163-168(6)

Publisher: Elsevier

An Algorithm for Packing Connectors

Author: Keijsper J.

Source: Journal of Combinatorial Theory, Series B, Volume 74, Number 2, November 1998 , pp. 397-404(8)

Publisher: Elsevier

The Reykjanes Ridge: structure and tectonics of a hot-spot-influenced, slow-spreading ridge, from multibeam bathymetry, gravity and magnetic investigations

Authors: Ryjacek Z.; Schiermeyer I.; Searle R.C.; Keeton J.A.; Owens R.B.; White R.S.; Mecklenburgh R.; Parsons B.; Lee S.M.

Source: Earth and Planetary Science Letters, Volume 160, Number 3, August 1998 , pp. 463-478(16)

Publisher: Elsevier

An Algorithm for Packing Connectors

Author: Keijsper J.

Source: Journal of Combinatorial Theory, Series B, Volume 74, Number 2, November 1998 , pp. 397-404(8)

Publisher: Academic Press

Cortical activity of good and poor spatial test performers during spatial and verbal processing studied with Slow Potential Topography

Authors: Bunke H.; Vitouch O.; Bauer H.; Gittler G.; Leodolter M.; Leodolter U.

Source: International Journal of Psychophysiology, Volume 27, Number 3, December 1997 , pp. 183-199(17)

Publisher: Elsevier

Clique-Detection Algorithms for Matching Three-Dimensional Molecular Structures - A comparison of CoMFA models based on deduced and experimentally determined active site geometries

Authors: Gardiner E.J.; Artymiuk P.J.; Willett P.

Source: Journal of Molecular Graphics and Modelling, Volume 15, Number 4, August 1997 , pp. 245-253(9)

Publisher: Elsevier

On a relation between graph edit distance and maximum common subgraph

Author: Bunke H.

Source: Pattern Recognition Letters, Volume 18, Number 8, August 1997 , pp. 689-694(6)

Publisher: Elsevier

Tight Bounds for the Maximum Acyclic Subgraph Problem

Authors: Berger B.; Shor P.W.

Source: Journal of Algorithms, Volume 25, Number 1, October 1997 , pp. 1-18(18)

Publisher: Academic Press

Connected graphs with prescribed median and periphery

Author: Winters S.J.

Source: Discrete Mathematics, Volume 159, Number 1, 1 November 1996 , pp. 223-236(14)

Publisher: Elsevier