SDM '15 タイトルだけ見てきになったやつ

論文読み

グラフアルゴリズムっぽいやつらだけ。それにしても最近論文読めてない...

  • A Divide‐and‐Conquer Algorithm for Betweenness Centrality Dora  Erdos*, Boston University; Vatche Ishakian, IBM ; Evimaria Terzi, Boston University; Azer Bestavros

  • Cheetah: Fast Graph Kernel Tracking on Dynamic Graphs Liangyue Li*, Arizona State University; Hanghang Tong, ASU; Yanghua Xiao, Fudan University; Wei Fan, Huawei Noahs Ark Lab

  • Community Detection for Emerging Networks Jiawei Zhang*, UIC; Philip S. Yu, University of Illinois at Chicago

  • Efficient Algorithms for a Robust Modularity‐Driven Clustering of Attributed Graphs Patricia Iglesias Sanchez*, KIT; Emmanuel Müller, Karlsruhe Institute of Technology (KIT); Uwe Leo Korn, KIT; Klemens Boehm, KIT; Andrea Kappes, KIT; Tanja Hartmann, ; Dorothea Wagner, KIT

  • Fast Eigen‐Functions Tracking on Dynamic Graphs Chen Chen*, Arizona State University; Hanghang  Tong , Arizona State University]

  • Functional Node Detection on Linked Data Kang Li*, State University of New York at Buffalo; Jing Gao, SUNY at Buffalo; Suxin Guo, University at Buffalo, The State University of New York; Nan Du, University at Buffalo, The State University of New York; Aidong Zhang, State University of New York at Buffalo

  • On Influential Nodes Tracking in Dynamic Social Networks Xiaodong Chen*, Peking University

  • Rare Class Detection  in Networks Karthik Subbian*, University of Minnesota; Charu Aggarwal, IBM Watson Research; Jaideep Srivastava, University of Minnesota; Vipin Kumar, UMN

  • Vertex Clustering of Augmented Graph Streams Ryan McConville*, Queen's University Belfast; Weiru Liu, Queen's University Belfast; Paul Miller, Queen's University Belfast

  • Where Graph Topology Matters: The Robust Subgraph Problem Hau Chan, Stony Brook University; Shuchu Han, Stony Brook University; Leman Akoglu*, SUNY Stony Brook