ILIGRA: An Efficient Inverse Line Graph Algorithm

This paper presents a new and efficient algorithm, ILIGRA, for inverse line graph construction. Given a line graph H, ILIGRA constructs its root graph G with the time complexity being linear in the number of nodes in H. If ILIGRA does not know whether the given graph H is a line graph, it firstly assumes that H is a line graph and starts its...

Characterizing the Structure of Affiliation Networks

ur society contains all types of organizations, such as companies, research groups and hobby clubs. Affliation networks, as a large and important portion of social networks, consist of individuals and their affiation relations: Two individuals are connected by a link if they belong to the same organization(s). Affliation networks naturally...