Chung-Hao Chang

  • Citations Per Year
Learn More
A k -container C(u,v) of a graph G is a set of k disjoint paths between u and v. A k-container C(u,v) of G is a k * -container if it contains all vertices of G. A graph G is k * -connected if there exists a k *-container between any two distinct vertices of G. Therefore, a graph is 1*-connected (respectively, 2*-connected) if and only if it is Hamiltonian(More)
Social networks, which have become extremely popular in the twenty first century, contain a tremendous amount of user-generated content about real-world events. This user-generated content relays real-world events as they happen, and sometimes even ahead of the newswire. The goal of this work is to identify events from social streams. The proposed model(More)
  • 1