Cite
Discovering Frequent Graph Patterns Using Disjoint Paths.
MLA
Gudes, Ehud, and Solomon Eyal Shimony. “Discovering Frequent Graph Patterns Using Disjoint Paths.” IEEE Transactions on Knowledge & Data Engineering, vol. 18, no. 11, Nov. 2006, pp. 1441–56. EBSCOhost, https://doi.org/10.1109/TKDE.2006.173.
APA
Gudes, E., & Shimony, S. E. (2006). Discovering Frequent Graph Patterns Using Disjoint Paths. IEEE Transactions on Knowledge & Data Engineering, 18(11), 1441–1456. https://doi.org/10.1109/TKDE.2006.173
Chicago
Gudes, Ehud, and Solomon Eyal Shimony. 2006. “Discovering Frequent Graph Patterns Using Disjoint Paths.” IEEE Transactions on Knowledge & Data Engineering 18 (11): 1441–56. doi:10.1109/TKDE.2006.173.