Center-piece subgraphs: problem definition and fast solutions

H Tong, C Faloutsos - Proceedings of the 12th ACM SIGKDD …, 2006 - dl.acm.org
Given Q nodes in a social network (say, authorship network), how can we find the
node/author that is the center-piece, and has direct or indirect connections to all, or most of …
被引用次数：356 相关文章

Center-piece subgraphs: Problem definition and fast solutions

H Tong, C Faloutsos - KDD 2006: 12th ACM SIGKDD …, 2006 - asu.elsevierpure.com
Given Q nodes in a social network (say, authorship network), how can we find the
node/author that is the center-piece, and has direct or indirect connections to all, or most of …
[PDF] cmu.edu

[PDF][PDF] Center-Piece Subgraphs: Problem Definition and Fast Solutions

H Tong, C Faloutsos - 2006 - cs.cmu.edu
Given Q nodes in a social network (say, authorship network), how can we find the
node/author that is the centerpiece, and has direct or indirect connections to all, or most of …
[PDF] bu.edu

[PDF][PDF] Center-Piece Subgraphs: Problem Definition and Fast Solutions

H Tong, C Faloutsos - 2006 - cs-people.bu.edu
Given Q nodes in a social network (say, authorship network), how can we find the
node/author that is the centerpiece, and has direct or indirect connections to all, or most of …
[PDF] iitb.ac.in

[PDF][PDF] Center-Piece Subgraphs: Problem Definition and Fast Solutions

H Tong, C Faloutsos - 2005 - cse.iitb.ac.in
Given Q nodes in a social network (say, authorship network), how can we find the
node/author that is the centerpiece, and has direct or indirect connections to all, or most of …
[PDF] aalto.fi

[PDF][PDF] Center-Piece Subgraphs: Problem Definition and Fast Solutions

H Tong, C Faloutsos - 2006 - users.ics.aalto.fi
Given Q nodes in a social network (say, authorship network), how can we find the
node/author that is the centerpiece, and has direct or indirect connections to all, or most of …
[PDF] tonghanghang.org

[PDF][PDF] Center-Piece Subgraphs: Problem Definition and Fast Solutions

H Tong, C Faloutsos - 2005 - tonghanghang.org
Given Q nodes in a social network (say, authorship network), how can we find the
node/author that is the centerpiece, and has direct or indirect connections to all, or most of …

[引用][C] Center-piece subgraphs: Problem definition and fast solutions

H TONG - Proc. 12th ACM SIGKDD Conference, 2006, 2006 - cir.nii.ac.jp
[PDF] cmu.edu

[PDF][PDF] Center-Piece Subgraphs: Problem Definition and Fast Solutions

H Tong, C Faloutsos - 2006 - reports-archive.adm.cs.cmu.edu
Given Q nodes in a social network (say, authorship network), how can we find the
node/author that is the center-piece, and has direct or indirect connections to all, or most of …
[PDF] psu.edu

[PDF][PDF] Center-Piece Subgraphs: Problem Definition and Fast Solutions

H Tong, C Faloutsos - 2006 - Citeseer
Given Q nodes in a social network (say, authorship network), how can we find the
node/author that is the centerpiece, and has direct or indirect connections to all, or most of …