![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. William H. Milnor Cartic Ramakrishnan , William H. Milnor, Matthew Perry , Amit P. Sheth : Discovering informative connection subgraphs in multi-relational graphs. SIGKDD Explorations 7 (2): 56-63 (2005) 1 [ 1 ] 2 [ 1 ] 3 [ 1 ] ![]() ©2006 Association for Computing Machinery |