A note on the derivation of maximal common subgraphs of two directed or undirected graphs
CALCOLO1973Vol. 9(4), pp. 341–352
Citations Over TimeTop 21% of 1973 papers
Related Papers
- → Between Subgraph Isomorphism and Maximum Common Subgraph(2017)27 cited
- → Marked subgraph isomorphism of ordered graphs(1998)13 cited
- → An Optimization of Closed Frequent Subgraph Mining Algorithm(2017)7 cited
- → Frequent subgraph mining based on the automorphism mapping(2012)1 cited
- Frequent Subgraph Mining Algorithm of Gradually Right-most Extension(2011)