Abstract
Vera T. Sós is probably the single most influential person for orienting the research interest of many of the participants of this conference towards discrete mathematics. It is appropriate to recall that the single most influential person for orienting his interest towards discrete mathematics was his secondary school math teacher, Tibor Gallai who achieved outstanding results in several areas of graph theory. In this note the first forty years of the influence on VLSI design of a classic result of Gallai about the perfectness of interval graphs is described.
This is a preview of subscription content, log in via an institution to check access.
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
A. Aggarwal, J. Kleinberg and D. P. Williamson, Node-disjoint paths on the mesh and a new trade-off in VLSI layout, SIAM J. Computing, 29 (2000), 1321–1333.
E. Boros, A. Recski and F. Wettl, Unconstrained multilayer switchbox routing, Annals of Operations Research, 58 (1995), 481–491.
T. Gallai, His unpublished results were announced in A. Hajnal and J. Surányi, Über die Auflösung von Graphen in vollständige Teilgraphen, Annales Univ. Sci. Budapest Eötvös Sect. Math., 1 (1958), 115–123.
S. E. Hambrusch, Channel routing in overlap models, IEEE Trans. Computer-Aided Design of Integrated Circ. Syst., CAD-4 (1985), 23–30.
D. S. Johnson, The NP-completeness column: An ongoing guide, J. Algorithms, 5 (1984), 147–160.
M. Marek-Sadowska and E. Kuh, General channel-routing algorithm, Proc. IEE (GB), 130 (1983), 83–88.
A. Recski, Channel routing in the dogleg-free multilayer Manhattan model, Proc. ECCTD’97 (1997), 39–43.
A. Recski and F. Strzyzewski, Vertex-disjoint channel routing on two layers, Integer programming and combinatorial optimization (Ravi Kannan and W. R. Pulleyblank, ed.), University of Waterloo Press (1990), 397–405.
A. Recski and D. Szeszlér, 3-dimensional single active layer routing, Discrete and Computational Geometry, Lecture Notes in Computer Science 2098, 318–329, Springer, Berlin (2001).
A. Recski and D. Szeszlér, Routing Vertex Disjoint Steiner-Trees in a Cubic Grid — an Application in VLSI, submitted.
D. Szeszlér, Switchbox routing in the multilayer Manhattan model, Annales Univ. Sci. Budapest. Eötvös Sect. Math., 40 (1997), 155–164.
T. G. Szymanski, Dogleg channel routing is NP-complete, IEEE Trans. Computer-Aided Design of Integrated Circ. Syst., CAD-4 (1985), 31–41.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 János Bolyai Mathematical Society and Springer Verlag
About this chapter
Cite this chapter
Recski, A., Szeszlér, D. (2006). The Evolution of an Idea — Gallai’s Algorithm. In: Győri, E., Katona, G.O.H., Lovász, L., Fleiner, T. (eds) More Sets, Graphs and Numbers. Bolyai Society Mathematical Studies, vol 15. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32439-3_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-32439-3_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32377-8
Online ISBN: 978-3-540-32439-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)