Abstract
Graph theory, which used to be a purely academic discipline, is now increasingly becoming a prerequisite to effective application of computers in numerous applied fields. In the paper, current works are surveyed on creation of support tools for application of graphs in programming conducted by the Laboratory for Program Construction and Optimization of the Ershov Institute of Information Systems, Siberian Division, Russian Academy of Sciences. These works are supported by the Russian Foundation for Basic Research and the Ministry of Education. We start by considering the works on creation of an encyclopedia of graph algorithms for programmers. Techniques and tools for visual processing of graphs and graph models are described. An explanatory dictionary on graph theory in computer science and programming and its electronic version are discussed.
Article PDF
Similar content being viewed by others
REFERENCES
Aho, A. and Ullman, J., The Theory of Parsing, Translation, and Compiling, 2 vols., Englewood Cliffs, New York:Prentice Hall, 1972—1973. Translated under the title Teoriya sintaksicheskogo analiza, perevoda i kompilyatsii, 2 vols., Moscow: Mir, 1978.
Evstigneev, V.A., Primenenie teorii grafov v programmirovanii (Graph Theory for Programming), Moscow: Nauka, 1984.
Evstigneev, V.A. and Kasyanov, V.N., Teoriya grafov: algoritmy obrabotki derev'ev (Graph Theory: Algorithms for Tree Processing), Novosibirsk: Nauka, 1994.
Evstigneev, V.A. and Kasyanov, V.N., Teoriya grafov: algoritmy obrabotki beskonturnykh grafov (Graph Theory: Acyclic Graph Algorithms), Novosibirsk: Nauka, 1998.
Evstigneev, V.A. and Kasyanov, V.N., Svodimye grafy i graf-modeli v programmirovanii (Reducible Graphs and Graph Models in Programming), Novosibirsk: Inst. Diskretnoi Mat. Informatiki, 1999.
Evstigneev, V.A. and Kasyanov, V.N., Tolkovyi slovar' po teorii grafov v informatike i programmirovanii (Explanatory Dictionary on Graph Theory in Informatics and Programming), Novosibirsk: Nauka, 1999.
Information on the ffGraph library can be found at http://www.fmi.uni-passau.de/~friedric/ffgraph/main.shtml.
Information on the AGD library can be found at http://www.mpi-sb.mpg.de/~mutzel/dfgdraw/agdlib.html.
Information on the HIGRES system and the distribution for download can be found at http://pco.iis.nsk/higres.
Kasyanov, V.N., Efficient Transformation of Irreducible Graphs, in Sistemnoe i teoreticheskoe programmirovanie (System and Theoretical Programming), Novosibirsk: Computer Center, Siberian Division, USSR Academy of Sciences, 1973, pp. 143–172.
Kasyanov, V.N., Program Structure Analysis, Kibernetika, 1980, no. 1, pp. 48–61.
Kasyanov, V.N., Metody analiza program (Methods for Program Analysis), Novosibirsk: Novosibirsk Gos. Univ., 1982.
Kasyanov, V.N., Graph-Theoretical Problems of Analysis of Control Flow Graphs for Translated Programs, in Issledovaniya po prikladnoi teorii grafov (Applied Graph Theory Studies), Novosibirsk: Nauka, 1986, pp. 9–25.
Kasyanov, V.N., Optimiziruyushchie preobrazovaniya program (Optimizing Transformations of Programs), Moscow: Nauka, 1988.
Kasyanov, V.N., Hierarchical Graphs and Graph Models: Problems of Visual Processing, in Problemy sistem informatiki i programmirovaniya (Problems of Informatics and Progamming Systems), Novosibirsk: Inst. Sistem Informatiki, 1999, pp. 7–32.
Kasyanov, V.N. and Pottosin, I.V., Metody postroeniya translyatorov (Methods for Construction of Translators), Novosibirsk: Nauka, 1986.
Knuth, D., The Art of Computer Programming, 3 vols., Reading, Mass.: Addison-Wesley, 1968. Translated under the title Iskusstvo programmirovaniya dlya EVM, Moscow: Mir, 1976—1978.
Lektsii po teorii grafov (Lectures on Graph Theory), Emelichev, V.A., Mel'nikov, O.I., Sarvanov, V.I., and Tyshkova, R.I., Eds., Moscow: Nauka, 1990.
Lisitsyn, I.A., Application of the HIGRES System to Visual Processing of Hierarchical Graph Models, in Problemy sistem informatiki i programmirovaniya (Problems of Informatics and Progamming Systems), Novosibirsk: Inst. Sistem Informatiki, 1999, pp. 64–77.
The GRAPP digital explanatory dictionary can be found at http://pco.iis.nsk.su/grapp.
Computing by Graph Transformation: A Survey and Annotated Bibliography, Ehrig, H. and Taentzer, G., Eds., Bull. EATCS, 1996, no. 59, pp. 182–226.
Corradini, A. and Kreowski, H.-J., GETGATS and APPLIGRAPH: Theory and Applications of Graph Transformation, Bull. EATCS, 1997, no. 63, pp. 109–114.
Di Battista, G., Eades, P., Tamassia, R., and Tollis, I.G., Graph Drawing: Algorithms for Visualization of Graphs, Prentice Hall, 1999.
Di Battista, G., Eades, P., Tamassia, R., and Tollis, I.G., Algorithms for Drawing Graphs: An Annotated Bibliography, Comput. Geom. Theory Appl., 1994, vol. 4, pp. 235–282.
Feng, Q.W., Cohen, R.F., and Eades, P., Planarity for Clustered Graphs, Lecture Notes in Computer Science, Berlin: Springer, 1995, vol. 979, pp. 213–226.
Fröhlich, M. and Werner, M., Demonstration of the Interactive Graph Visualization System daVinci, Lecture Notes in Computer Science, Berlin: Springer, 1994, vol. 894, pp. 266–269.
Harel, D., On Visual Formalism, Commun. ACM, 1988, vol. 31, no. 5, pp. 514–530.
Himsolt, M., GraphEd: A Graphical Platform for the Implementation of Graph Algorithms (Extended Abstract and Demo), Lecture Notes in Computer Science, Berlin: Springer, 1994, vol. 894, pp. 182–193.
Himsolt, M., The Graphlet System (System Demonstration), Lecture Notes in Computer Science, Berlin: Springer, 1996, vol. 1190, pp. 233–240.
Kasyanov, V.N., Some Properties of Fully Reducible Graphs, Information Processing Lett., 1973, vol. 2, no. 4, pp. 113–117.
Kasyanov, V.N., Hierarchical Graphs and Visual Processing, Int. Congr. of Mathematicians (ICM98): Abstracts of Short Commun. and Poster Sessions, Berlin, 1998, p. 292.
Kasyanov, V.N. and Evstigneev, V.A., Graph Theory for Programmers: Algorithms for Processing Trees, Kluwer Academics, 2000.
Kasyanov, V.N. and Lisitsyn, I.A., Hierarchical Graph Models and Visual Processing, Proc. Int. Conf. on Software: Theory and Practice, 16th World Comput. Congr. IFIP, Beijing, PHEI, 2000, pp. 119–123.
Lauer, H., Ettrich, M., and Soukup, K., GraVis: System Demonstration, Lecture Notes in Computer Science, Berlin: Springer, 1997, vol. 1353, pp. 344–349.
Lisitsin, I.A. and Kasyanov, V.N., HIGRES: Visualization System for Clustered Graphs and Graph Algorithms, Lecture Notes in Computer Science, Berlin: Springer, 1999, vol. 1731, pp. 82–89.
Madden, B., Madden, P., Powers, S., and Himsolt, M., Portable Graph Layout and Editing, Lecture Notes in Computer Science, Berlin: Springer, 1995, vol. 1027, pp. 385–395.
Mehlhorn, K. and Näher, S., LEDA: A Platform for Combinatorial and Geometric Computing, Commun. ACM, 1995, vol. 38, pp. 96–102.
Nagl, M., A Tutorial and Bibliographical Survey of Graph Grammars, Lecture Notes in Computer Science, Berlin: Springer, 1980, vol. 73, pp. 70–126.
Sander, G., Graph Layout through the VCG Tool, Lecture Notes in Computer Science, Berlin: Springer, 1994, vol. 894, pp. 194–205.
Sugiyama, K. and Misue, K., Visualization of Structured Digraphs, IEEE Trans. Systems, Man, Cybernetics, 1991, vol. 21, no.4, pp. 876–892.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kasyanov, V.N. Graph Applications in Programming. Programming and Computer Software 27, 146–164 (2001). https://doi.org/10.1023/A:1010990400700
Issue Date:
DOI: https://doi.org/10.1023/A:1010990400700