Home › Entities › academic_journal_article › Representing Clusters Using a Maximum Common Edge Substructure Algorithm Applied to Reduced Graphs and Molecular Graphs

Representing Clusters Using a Maximum Common Edge Substructure Algorithm Applied to Reduced Graphs and Molecular Graphs

Representing Clusters Using a Maximum Common Edge Substructure Algorithm Applied to Reduced Graphs and Molecular Graphs is a scholarly article.

CreativeWork academic_journal_article Q51922027
Press Enter · cited answer in seconds

Key Facts

  • Publication date: February 20, 2007[1]
  • Published in: Journal of Chemical Information and Modeling[2]
  • Title: Representing Clusters Using a Maximum Common Edge Substructure Algorithm Applied to Reduced Graphs and Molecular Graphs[3]

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [1] ↑ . wikidata.org.
  2. [2] ↑ . wikidata.org.
  3. [3] ↑ . wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Representing Clusters Using a Maximum Common Edge Substructure Algorithm Applied to Reduced Graphs and Molecular Graphs. Retrieved October 18, 2026, from https://4ort.xyz/entity/representing-clusters-using-a-maximum-common-edge-substructure-algorithm-applied-to-reduced-graphs-and-molecular-graphs-openalex-w2951440056
MLA “Representing Clusters Using a Maximum Common Edge Substructure Algorithm Applied to Reduced Graphs and Molecular Graphs.” 4ort.xyz Knowledge Graph, 4ort.xyz, 18 Oct. 2026, https://4ort.xyz/entity/representing-clusters-using-a-maximum-common-edge-substructure-algorithm-applied-to-reduced-graphs-and-molecular-graphs-openalex-w2951440056.
BibTeX @misc{4ortxyz_representing-clusters-using-a-maximum-common-edge-substructure-algorithm-applied-to-reduced-graphs-and-molecular-graphs-openalex-w2951440056_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Representing Clusters Using a Maximum Common Edge Substructure Algorithm Applied to Reduced Graphs and Molecular Graphs}}, year = {2026}, url = {https://4ort.xyz/entity/representing-clusters-using-a-maximum-common-edge-substructure-algorithm-applied-to-reduced-graphs-and-molecular-graphs-openalex-w2951440056}, note = {Accessed: 2026-10-18}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Representing Clusters Using a Maximum Common Edge Substructure Algorithm Applied to Reduced Graphs and Molecular Graphs — https://4ort.xyz/entity/representing-clusters-using-a-maximum-common-edge-substructure-algorithm-applied-to-reduced-graphs-and-molecular-graphs-openalex-w2951440056 (retrieved 2026-10-18)

Canonical URL: https://4ort.xyz/entity/representing-clusters-using-a-maximum-common-edge-substructure-algorithm-applied-to-reduced-graphs-and-molecular-graphs-openalex-w2951440056 · Last refreshed: