ILIGRA: An Efficient Inverse Line Graph Algorithm

This paper presents a new and efficient algorithm, IligraLIGRA, 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 root graph construction. During the root graph construction, ILIGRA checks whether the given graph H is a line graph and ILIGRA stops once it finds H is not a line graph. The time complexity of ILIGRA with line graph checking is linear in the number of links in the given graph H. For sparse line graphs of any size and for dense line graphs of small size, numerical results of the running time show that ILIGRA outperforms all currently available algorithms.

[1]  Philippe G. H. Lehot.  An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph , 1974, JACM.

[2]  Lev Muchnik,et al.  Line graphs as social networks , 2010, ArXiv.

[3]  Nick Roussopoulos,et al.  A MAX{m, n} Algorithm for Determining the Graph H from Its Line Graph C , 1973, Inf. Process. Lett..

[4]  Piet Van Mieghem,et al.  Graph Spectra for Complex Networks , 2010 .

[5]  H. Whitney.  Congruent Graphs and the Connectivity of Graphs , 1932 .

[6]  O. Ore.  Theory of Graphs , 1962 .

[7]  Dragoš Cvetković,et al.  Spectral Generalizations of Line Graphs: Preface , 2004 .

[8]  Krzysztof Kulakowski,et al.  Clustering in random line graphs , 2009, Comput. Phys. Commun..

[9]  Herbert S. Wilf,et al.  The interchange graph of a finite graph , 1965 .

[10]  Béla Bollobás,et al.  Random Graphs , 1985 .

[11]  Augustin-Louis Cauchy,et al.  Cours d'Analyse de l'École Royale Polytechnique: Frontmatter , 2009 .

[12]  Joseph Naor,et al.  An Efficient Reconstruction of a Graph from its Line Graph in Parallel , 1990, J. Algorithms.

[13]  R. Lambiotte,et al.  Line graphs, link partitions, and overlapping communities. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  A. Cauchy.  Cours d'analyse de l'École royale polytechnique , 1821 .

[15]  Klaus Simon,et al.  A Dynamic Algorithm for Line Graph Recognition , 1995, WG.

[16]  Sune Lehmann,et al.  Link communities reveal multiscale complexity in networks , 2009, Nature.

[17]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[18]  Dragoš Cvetković,et al.  Spectral Generalizations of Line Graphs: Introduction , 2004 .

[19]  J. C. Nacher,et al.  Two complementary representations of a scale-free network , 2005 .

[20]  Kurt Mehlhorn,et al.  LEDA: a platform for combinatorial and geometric computing , 1997, CACM.

[21]  Krzysztof Kulakowski,et al.  Assortativity in random line graphs , 2009 .

[22]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .