Maximum common subgraph¶

Huang, X., Lai, J., & Jennings, S. F. (2006). Maximum common subgraph: some upper bound and lower bound results. BMC Bioinformatics.

Type: Journal article
Intellectual base: Primary research
Year: 2006
DOI: 10.1186/1471-2105-7-s4-s6
Link: https://doi.org/10.1186/1471-2105-7-S4-S6

Cited by¶

1 citation across 1 artifact.

Domain-specific¶

Modular product of graphs
- Modular product of graphs is a graph product on the Cartesian product of two vertex sets whose adjacency encodes agreement of adjacency or nonadjacency in the factor graphs.

Verification¶

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:bd6d0804c9ec · see in the full table