A dynamic algorithm for line graph recognition

  • Daniele Giorgio Degiorgi
  • Klaus Simon
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1017)


For a graph G=(V, E) its line graph L(G) has the node set E and two nodes of L(G) are adjacent if the corresponding edges of G have a common endpoint. The problem of finding G for a given L was already optimally solved by Lehot[7] and Roussopoulos[11]. Here we present a new dynamic solution to this problem, where we can add or delete a node v in L(G) in time proportional to the size of its adjacency list.


Line Graph Bijective Function Colour Class Complete Subgraph Adjacency List 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    D. Eppstein, Z. Galil, G.F. Italiano and T. Spencer. Separator based sparsification for dynamic planar graph algorithms. Proc. 25th Annual Symp. on Theory of Computing (1993), 208–217.Google Scholar
  2. 2.
    M. R. Garey and D. S. Johnson. Computers and Intractability. A Guide to the Theory of NP-Completeness. W. Freeman and Company, 1979.Google Scholar
  3. 3.
    M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs, Academic Press, 1980.Google Scholar
  4. 4.
    F. Harary. Graph Theory, Addison-Wesley, 1969.Google Scholar
  5. 5.
    H. A. Jung. Zu einem Isomorphiesatz von H. Whitney für Graphen. Math. Annalen164 (1966), 270–271.Google Scholar
  6. 6.
    J. Krausz. Démonstration nouvelle d'un théorème de Whitney sur les résaux. Mat. Fiz. Lapok50(1943), 75–85.Google Scholar
  7. 7.
    P. G. H. Lehot. An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph. Journal of the ACM21(1974), 569–575.Google Scholar
  8. 8.
    J. Naor and M.B. Novick. An Efficient Reconstruction of a Graph from Its Line Graph in Parallel. Journal of Algorithms11(1990), 132–143.Google Scholar
  9. 9.
    O. Ore. Theory of Graphs, American Mathematical Society Colloquium Publications, 38(1962).Google Scholar
  10. 10.
    M. Rauch. Improved data structures for fully dynamic biconnectivity. Proc. 26th Annual Symp. on Theory of Computing (1994), 686–695.Google Scholar
  11. 11.
    N. D. Roussopoulos. A max{m, n} Algorithm for Detecting the Graph H from its Line Graph G. Information Processing Letters2(1973), 108–112.Google Scholar
  12. 12.
    K. Simon. Effiziente Algorithmen für perfekte Graphen. B. G. Teubner, Stuttgart, 1992.Google Scholar
  13. 13.
    H.-P. Schmocker. Erkennung von Kantengraphen. Diploma thesis, Institut für Theoretische Informatik, ETH Zürich, 1991.Google Scholar
  14. 14.
    A. C. M. van Rooij and H. S. Wilf. The Interchange Graph of a Finite Graph. Acta Mathematica Academiae Scientiarum Hungaricae16(1965), 263–269.Google Scholar
  15. 15.
    H. Whitney. Congruent Graphs and the Connectivity of Graphs. American Journal of Mathematics54(1932), 150–168.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Daniele Giorgio Degiorgi
    • 1
  • Klaus Simon
    • 2
  1. 1.MassagnoSwitzerland
  2. 2.Institute for Theoretical Computer ScienceSwiss Federal Institute of Technology ZurichZurichSwitzerland

Personalised recommendations