Abstract
This paper presents a complete (infinite) axiomatization for an algebraic construction of graphs, in which a finite fragment denotes the class of graphs with bounded tree width.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ariola, Z.M., Arvind: Properties of a first-order functional language with sharing. Theoretical Computer Science 146(1-2), 69–108 (1995)
Arnborg, S., Courcelle, B., Proskurowski, A., Seese, D.: An algebraic theory of graph reduction. Journal of the Association for Computing Machinery 40(5), 1134–1164 (1993)
Bauderon, M., Courcelle, B.: Graph expressions and graph rewritings. Mathematical System Theory 20, 83–127 (1987)
Borie, R.B., Parker, R.G., Tovey, C.A.: Automatic generation of lineartime algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Algorithmica 7, 555–581 (1992)
Courcelle, B.: Graph rewriting: An algebraic and logic approach. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, ch. 5, pp. 194–242. Elsevier Science Publishers, Amsterdam (1990)
Căzănescu, V.-E., Stefănescu, G.: A general result on abstract flowchart schemes with applications to study of accessibility, reduction and minimization. Theoretical Computer Science 99, 1–63 (1992)
Erwig, M.: Functional programming with graphs. In: Proc. 1997 ACM SIGPLAN International Conference on Functional Programming, ICFP 1997, SIGPLAN Notices, vol. 32(8), pp. 52–65. ACM Press, New York (1997)
Fegaras, L., Sheard, T.: Revisiting catamorphisms over datatypes with embedded functions (or, programs from outer space). In: Proc. 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1996, pp. 284–294. ACM Press, New York (1996)
Gibbons, J.: An initial-algebra approach to directed acyclic graphs. In: Möller, B. (ed.) MPC 1995. LNCS, vol. 947, pp. 282–303. Springer, Heidelberg (1995)
Gustedt, J., Mæhle, O.A., Telle, A.: The treewidth of Java programs. In: Mount, D.M., Stein, C. (eds.) ALENEX 2002. LNCS, vol. 2409, pp. 86–97. Springer, Heidelberg (2002)
Hasegawa, M.: Models of sharing graphs, PhD thesis, University of Edinburgh (1997)
Plasmeijer, M.J., Sleep, M.R., van Eekelen, M.C.J.D. (eds.): Term Graph Rewriting, Theory and Practice. Wiley, Chichester (1994)
Ogawa, M., Hu, Z., Sasano, I.: Iterative-free program analysis. In: Proc. 8th ACM SIGPLAN International Conference on Functional Programming, ICFP 2003, Uppsala, Sweden, pp. 111–123. ACM Press, New York (2003)
Robertson, N., Seymour, P.D.: Graph minors II. algorithmic aspects of tree-width. Journal of Algorithms 7, 309–322 (1986)
Sasano, I., Hu, Z., Takeichi, M., Ogawa, M.: Make it practical: A generic linear-time algorithms for solving maximum-weightsum problems. In: Proc. 5th ACM SIGPLAN International Conference on Functional Programming, ICFP 2000, Montreal, Canada, pp. 137–149. ACM Press, New York (2000)
Thomas, R.: A Menger-like property of tree-width: The finite case. Journal of Combinatorial Theory, Series B 48, 67–76 (1990)
Thorup, M.: All structured programs have small tree width and good register allocation. Information and Computation 142, 159–181 (1998)
Weyl, H.: Classical groups. Princeton University Press, Princeton (1939)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ogawa, M. (2004). Complete Axiomatization of an Algebraic Construction of Graphs. In: Kameyama, Y., Stuckey, P.J. (eds) Functional and Logic Programming. FLOPS 2004. Lecture Notes in Computer Science, vol 2998. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24754-8_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-24754-8_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21402-1
Online ISBN: 978-3-540-24754-8
eBook Packages: Springer Book Archive