Rubinstein, J. H.; Thomas, D. A.; Wormald, N. C. Steiner trees for terminals constrained to curves. (English) Zbl 0869.05023 SIAM J. Discrete Math. 10, No. 1, 1-17 (1997). MSC: 05C05 90B85 68R10 PDFBibTeX XMLCite \textit{J. H. Rubinstein} et al., SIAM J. Discrete Math. 10, No. 1, 1--17 (1997; Zbl 0869.05023) Full Text: DOI
de la Torre, Pilar; Kao, David T. A uniform approach to the analysis of trie structures that store prefixing-keys. (English) Zbl 0866.68027 J. Algorithms 22, No. 2, 270-295 (1997). MSC: 68P05 68R10 PDFBibTeX XMLCite \textit{P. de la Torre} and \textit{D. T. Kao}, J. Algorithms 22, No. 2, 270--295 (1997; Zbl 0866.68027) Full Text: DOI
Klein, Philip N.; Plotkin, Serge A.; Rao, Satish; Tardos, Éva Approximation algorithms for Steiner and directed multicuts. (English) Zbl 0866.68072 J. Algorithms 22, No. 2, 241-269 (1997). MSC: 68R10 68W10 PDFBibTeX XMLCite \textit{P. N. Klein} et al., J. Algorithms 22, No. 2, 241--269 (1997; Zbl 0866.68072) Full Text: DOI Link
Fernández-Baca, David; Slutzki, Giora Optimal parametric search on graphs of bounded tree-width. (English) Zbl 0866.68029 J. Algorithms 22, No. 2, 212-240 (1997). MSC: 68P10 68R10 PDFBibTeX XMLCite \textit{D. Fernández-Baca} and \textit{G. Slutzki}, J. Algorithms 22, No. 2, 212--240 (1997; Zbl 0866.68029) Full Text: DOI Link
Fu, James Jianghai Directed graph pattern matching and topological embedding. (English) Zbl 0866.68073 J. Algorithms 22, No. 2, 372-391 (1997). MSC: 68R10 68P10 PDFBibTeX XMLCite \textit{J. J. Fu}, J. Algorithms 22, No. 2, 372--391 (1997; Zbl 0866.68073) Full Text: DOI
Penn, Michal; Shasha-Krupnik, Haya Improved approximation algorithms for weighted 2- and 3-vertex connectivity augmentation problems. (English) Zbl 0872.68143 J. Algorithms 22, No. 1, 187-196 (1997). MSC: 68R10 68W10 PDFBibTeX XMLCite \textit{M. Penn} and \textit{H. Shasha-Krupnik}, J. Algorithms 22, No. 1, 187--196 (1997; Zbl 0872.68143) Full Text: DOI
De Agostino, S.; Petreschi, R.; Sterbini, A. An \(O(n^ 3)\) recognition algorithm for bithreshold graphs. (English) Zbl 0869.68068 Algorithmica 17, No. 4, 416-425 (1997). MSC: 68R10 68W10 PDFBibTeX XMLCite \textit{S. De Agostino} et al., Algorithmica 17, No. 4, 416--425 (1997; Zbl 0869.68068) Full Text: DOI
Han, Yijie; Pan, V. Y.; Reif, J. H. Efficient parallel algorithms for computing all pair shortest paths in directed graphs. (English) Zbl 0869.68053 Algorithmica 17, No. 4, 399-415 (1997). MSC: 68W10 68R10 05C85 68Q22 PDFBibTeX XMLCite \textit{Y. Han} et al., Algorithmica 17, No. 4, 399--415 (1997; Zbl 0869.68053) Full Text: DOI
Pothen, Alex Graph partitioning algorithms with applications to scientific computing. (English) Zbl 0868.68090 Keyes, David E. (ed.) et al., Parallel numerical algorithms. Proceedings of the workshop, Hampton, VA, May 23–25, 1994. Dordrecht: Kluwer Academic Publishers. ICASE/LaRC Interdisciplinary Series in Science and Engineering. 4, 323-368 (1997). MSC: 68R10 68W10 PDFBibTeX XMLCite \textit{A. Pothen}, in: Parallel numerical algorithms. Proceedings of the workshop, Hampton, VA, May 23--25, 1994. Dordrecht: Kluwer Academic Publishers. 323--368 (1997; Zbl 0868.68090)
Hell, Pavol; Huang, Jing Two remarks on circular arc graphs. (English) Zbl 0868.05043 Graphs Comb. 13, No. 1, 65-72 (1997). Reviewer: Ma Zhongfan (Beijing) MSC: 05C75 68R10 PDFBibTeX XMLCite \textit{P. Hell} and \textit{J. Huang}, Graphs Comb. 13, No. 1, 65--72 (1997; Zbl 0868.05043) Full Text: DOI
Haralambides, J.; Makedon, F. Approximation algorithms for the bandwidth minimization problem for a large class of trees. (English) Zbl 0870.68078 Theory Comput. Syst. 30, No. 1, 67-90 (1997). MSC: 68W10 68R10 PDFBibTeX XMLCite \textit{J. Haralambides} and \textit{F. Makedon}, Theory Comput. Syst. 30, No. 1, 67--90 (1997; Zbl 0870.68078) Full Text: DOI
Heath, L. S. Graph embeddings and simplicial maps. (English) Zbl 0876.68082 Theory Comput. Syst. 30, No. 1, 51-65 (1997). MSC: 68R10 PDFBibTeX XMLCite \textit{L. S. Heath}, Theory Comput. Syst. 30, No. 1, 51--65 (1997; Zbl 0876.68082)
Kaklamanis, C.; Krizanc, D.; Rao, S. New graph decompositions with applications to emulations. (English) Zbl 0870.68114 Theory Comput. Syst. 30, No. 1, 39-49 (1997). MSC: 68R10 68U20 PDFBibTeX XMLCite \textit{C. Kaklamanis} et al., Theory Comput. Syst. 30, No. 1, 39--49 (1997; Zbl 0870.68114) Full Text: DOI
Cohen, R. F.; Eades, Peter; Lin, Tao; Ruskey, F. Three-dimensional graph drawing. (English) Zbl 0865.68120 Algorithmica 17, No. 2, 199-208 (1997). MSC: 68U05 68W10 PDFBibTeX XMLCite \textit{R. F. Cohen} et al., Algorithmica 17, No. 2, 199--208 (1997; Zbl 0865.68120) Full Text: DOI
Alonso, L.; Rémy, J. L.; Schott, R. A linear-time algorithm for the generation of trees. (English) Zbl 0865.68088 Algorithmica 17, No. 2, 162-182 (1997). MSC: 68R10 68W10 PDFBibTeX XMLCite \textit{L. Alonso} et al., Algorithmica 17, No. 2, 162--182 (1997; Zbl 0865.68088) Full Text: DOI
Chen, L. Efficient parallel recognition of some circular arc graphs. II. (English) Zbl 0865.68092 Algorithmica 17, No. 3, 266-280 (1997). MSC: 68R10 PDFBibTeX XMLCite \textit{L. Chen}, Algorithmica 17, No. 3, 266--280 (1997; Zbl 0865.68092) Full Text: DOI
Alon, N.; Yuster, R.; Zwick, U. Finding and counting given length cycles. (English) Zbl 0865.68093 Algorithmica 17, No. 3, 209-223 (1997). MSC: 68R10 PDFBibTeX XMLCite \textit{N. Alon} et al., Algorithmica 17, No. 3, 209--223 (1997; Zbl 0865.68093) Full Text: DOI
Ivković, Zoran; Sarnath, Ramnath; Sunder, Sivaprakasam Fully dynamic algorithms for permutation graph coloring. (English) Zbl 0865.68091 Int. J. Comput. Math. 63, No. 1-2, 37-55 (1997). MSC: 68R10 PDFBibTeX XMLCite \textit{Z. Ivković} et al., Int. J. Comput. Math. 63, No. 1--2, 37--55 (1997; Zbl 0865.68091) Full Text: DOI
Romanik, Kathleen Directed rectangle-visibility graphs have unbounded dimension. (English) Zbl 0865.68096 Discrete Appl. Math. 73, No. 1, 35-39 (1997). MSC: 68R10 PDFBibTeX XMLCite \textit{K. Romanik}, Discrete Appl. Math. 73, No. 1, 35--39 (1997; Zbl 0865.68096) Full Text: DOI Link
Cai, Leizhen; Schieber, Baruch A linear-time algorithm for computing the intersection of all odd cycles in a graph. (English) Zbl 0867.05066 Discrete Appl. Math. 73, No. 1, 27-34 (1997). Reviewer: J.Pallo (Dijon) MSC: 05C85 05C38 05C15 68R10 PDFBibTeX XMLCite \textit{L. Cai} and \textit{B. Schieber}, Discrete Appl. Math. 73, No. 1, 27--34 (1997; Zbl 0867.05066) Full Text: DOI Link
Gambosi, Giorgio; Protasi, Marco; Talamo, Maurizio Preserving approximation in the min-weighted set cover problem. (English) Zbl 0865.68095 Discrete Appl. Math. 73, No. 1, 13-22 (1997). MSC: 68R10 05B40 PDFBibTeX XMLCite \textit{G. Gambosi} et al., Discrete Appl. Math. 73, No. 1, 13--22 (1997; Zbl 0865.68095) Full Text: DOI Link
Mehlhorn, Kurt; Priebe, Volker On the all-pairs shortest-path algorithm of Moffat and Takaoka. (English) Zbl 0867.68058 Random Struct. Algorithms 10, No. 1-2, 205-220 (1997). MSC: 68R10 05C38 05C85 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{V. Priebe}, Random Struct. Algorithms 10, No. 1--2, 205--220 (1997; Zbl 0867.68058) Full Text: DOI
Everett, Hazel; Klein, Sulamita; Reed, Bruce An algorithm for finding homogeneous pairs. (English) Zbl 0874.05052 Discrete Appl. Math. 72, No. 3, 209-218 (1997). Reviewer: A.Brandstädt (Rostock) MSC: 05C85 68R10 PDFBibTeX XMLCite \textit{H. Everett} et al., Discrete Appl. Math. 72, No. 3, 209--218 (1997; Zbl 0874.05052) Full Text: DOI Link
Kloks, T. \(K_{1,3}\)-free and \(W_4\)-free graphs. (English) Zbl 0900.68231 Inf. Process. Lett. 60, No. 4, 221-223 (1997). MSC: 68W10 68R10 PDFBibTeX XMLCite \textit{T. Kloks}, Inf. Process. Lett. 60, No. 4, 221--223 (1997; Zbl 0900.68231) Full Text: DOI
Bax, Eric; Franklin, Joel A finite-difference sieve to count paths and cycles by length. (English) Zbl 0900.68230 Inf. Process. Lett. 60, No. 4, 171-176 (1997). MSC: 68W10 68R10 PDFBibTeX XMLCite \textit{E. Bax} and \textit{J. Franklin}, Inf. Process. Lett. 60, No. 4, 171--176 (1997; Zbl 0900.68230) Full Text: DOI
Venkatesan, G.; Pandu Rangan, C. Approximate triclique coloring for register allocation. (English) Zbl 0900.68334 Inf. Process. Lett. 60, No. 5, 249-253 (1997). MSC: 68R10 68W10 PDFBibTeX XMLCite \textit{G. Venkatesan} and \textit{C. Pandu Rangan}, Inf. Process. Lett. 60, No. 5, 249--253 (1997; Zbl 0900.68334) Full Text: DOI
Dell’Olmo, P.; Speranza, M. Grazia; Tuza, Zsolt Comparability graph augmentation for some multiprocessor scheduling problems. (English) Zbl 0865.68006 Discrete Appl. Math. 72, No. 1-2, 71-84 (1997). MSC: 68M20 68R10 PDFBibTeX XMLCite \textit{P. Dell'Olmo} et al., Discrete Appl. Math. 72, No. 1--2, 71--84 (1997; Zbl 0865.68006) Full Text: DOI Link
Bampis, Evripidis; Guinand, Frédéric; Trystram, Denis Some models for scheduling parallel programs with communication delays. (English) Zbl 0863.68015 Discrete Appl. Math. 72, No. 1-2, 5-24 (1997). MSC: 68M20 68R10 68N99 PDFBibTeX XMLCite \textit{E. Bampis} et al., Discrete Appl. Math. 72, No. 1--2, 5--24 (1997; Zbl 0863.68015) Full Text: DOI Link
Pudlák, Pavel; Sgall, Jiří An upper bound for a communication game related to time-space tradeoffs. (English) Zbl 0868.68086 Graham, Ronald L. (ed.) et al., The mathematics of Paul Erdős. Vol. I. Berlin: Springer. Algorithms Comb. 13, 393-399 (1997). MSC: 68R10 05C65 05C35 68Q15 PDFBibTeX XMLCite \textit{P. Pudlák} and \textit{J. Sgall}, Algorithms Comb. 13, 393--399 (1997; Zbl 0868.68086)
Beck, József Games, randomness and algorithms. (English) Zbl 0871.05048 Graham, Ronald L. (ed.) et al., The mathematics of Paul Erdős. Vol. I. Berlin: Springer. Algorithms Comb. 13, 280-310 (1997). Reviewer: R.Vohra (Columbus/Ohio) MSC: 05C80 91A43 68R10 05C85 PDFBibTeX XMLCite \textit{J. Beck}, Algorithms Comb. 13, 280--310 (1997; Zbl 0871.05048)
Johnsonbaugh, Richard Discrete mathematics. 4th ed. (English) Zbl 0860.68078 Upper Saddle River, NJ: Prentice Hall. xiv, 701 p. (1997). MSC: 68R10 68-01 68R05 05-01 PDFBibTeX XMLCite \textit{R. Johnsonbaugh}, Discrete mathematics. 4th ed. Upper Saddle River, NJ: Prentice Hall (1997; Zbl 0860.68078)
North, Stephen (ed.) Graph drawing. Symposium, GD ’96, Berkeley, CA, USA, September 18–20, 1996. Proceedings. (English) Zbl 0856.68002 Lecture Notes in Computer Science. 1190. Berlin: Springer. xi, 409 p. (1997). MSC: 68-06 00B25 PDFBibTeX XMLCite \textit{S. North} (ed.), Graph drawing. Symposium, GD '96, Berkeley, CA, USA, September 18--20, 1996. Proceedings. Berlin: Springer (1997; Zbl 0856.68002) Full Text: DOI
Shen, A. Algorithms and programming. Problems and solutions. (English) Zbl 0865.68049 Boston: Birkhäuser. viii, 217 p. (1997). Reviewer: J Żurawiecki and P.Wlaź (Lublin) MSC: 68W10 68-02 68R10 68N99 PDFBibTeX XMLCite \textit{A. Shen}, Algorithms and programming. Problems and solutions. Boston: Birkhäuser (1997; Zbl 0865.68049)
Bang-Jensen, J.; El Haddad, M.; Manoussakis, Y.; Przytycka, T. M. Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs. (English) Zbl 0864.68049 Algorithmica 17, No. 1, 67-87 (1997). MSC: 68W15 68R10 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Algorithmica 17, No. 1, 67--87 (1997; Zbl 0864.68049) Full Text: DOI
Preuß, Wolfgang; Wenisch, Günter Text- and exercise book on mathematics for computer scientists: Linear algebra and applications. (Lehr- und Übungsbuch Mathematik für Informatiker: Lineare Algebra und Anwendungen.) (German) Zbl 0871.68133 München: Fachbuchverlag Leipzig im Hanser Verlag. 328 p. (1997). Reviewer: D.Riebesehl (Lüneburg) MSC: 68R10 68-01 15-01 90C05 94A60 PDFBibTeX XMLCite \textit{W. Preuß} and \textit{G. Wenisch}, Lehr- und Übungsbuch Mathematik für Informatiker: Lineare Algebra und Anwendungen. München: Fachbuchverlag Leipzig im Hanser Verlag (1997; Zbl 0871.68133)
Yamazaki, Koichi A hierarchy of the class of apex NLC graph languages by bounds on the number of nonterminal nodes in productions. (English) Zbl 0865.68073 Acta Inf. 34, No. 5, 325-335 (1997). Reviewer: K.Yamazaki (Tokyo) MSC: 68Q42 68R10 68Q45 05C05 PDFBibTeX XMLCite \textit{K. Yamazaki}, Acta Inf. 34, No. 5, 325--335 (1997; Zbl 0865.68073) Full Text: DOI
Rus, Teodor; Pemmaraju, Sriram Using graph coloring in an algebraic compiler. (English) Zbl 0865.68028 Acta Inf. 34, No. 3, 191-209 (1997). Reviewer: T.Rus (Iowa City) MSC: 68N20 05C15 68R10 PDFBibTeX XMLCite \textit{T. Rus} and \textit{S. Pemmaraju}, Acta Inf. 34, No. 3, 191--209 (1997; Zbl 0865.68028) Full Text: DOI
Liang, Y. Daniel; Chang, Maw-Shang Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs. (English) Zbl 0865.68086 Acta Inf. 34, No. 5, 337-346 (1997). Reviewer: Y.D.Liang (Fort Wayne) MSC: 68R10 05C85 PDFBibTeX XML
Efe, Kemal; Eleser, Nancy An optimal emulator and VLSI layout for complete binary trees. (English) Zbl 0865.68085 Acta Inf. 34, No. 6, 429-447 (1997). Reviewer: K.Efe (Lafayette) MSC: 68R10 05C05 68W35 PDFBibTeX XMLCite \textit{K. Efe} and \textit{N. Eleser}, Acta Inf. 34, No. 6, 429--447 (1997; Zbl 0865.68085) Full Text: DOI
Djidjev, Hristo N.; Venkatesan, Shankar M. Reduced constants for simple cycle graph separation. (English) Zbl 0865.05049 Acta Inf. 34, No. 3, 231-243 (1997). Reviewer: H.N.Djidjev (Houston) MSC: 05C35 68R10 PDFBibTeX XMLCite \textit{H. N. Djidjev} and \textit{S. M. Venkatesan}, Acta Inf. 34, No. 3, 231--243 (1997; Zbl 0865.05049) Full Text: DOI
Hui, Chi-Chung; Chanson, Samuel T. Minimal communication cost software construction in the Internet environment. (English) Zbl 0869.68015 Acta Inf. 34, No. 8, 579-595 (1997). Reviewer: S.T.Chanson (Hong Kong) MSC: 68M10 68R10 68Q25 90B18 PDFBibTeX XMLCite \textit{C.-C. Hui} and \textit{S. T. Chanson}, Acta Inf. 34, No. 8, 579--595 (1997; Zbl 0869.68015) Full Text: DOI
Bogomolov, A. M.; Salij, V. N. Algebraic foundations of discrete system theory. (Algebraicheskie osnovy teorii diskretnykh sistem.) (Russian) Zbl 0906.68099 Moskva: Nauka. Fizmatlit. 368 p. (1997). Reviewer: B.M.Schein (Fayetteville) MSC: 68Q70 68-01 68Q45 68R10 PDFBibTeX XMLCite \textit{A. M. Bogomolov} and \textit{V. N. Salij}, Algebraicheskie osnovy teorii diskretnykh sistem (Russian). Moskva: Nauka. Fizmatlit (1997; Zbl 0906.68099)
Calabrese, Antonio Distributed acyclic orientation of asynchronous anonymous networks. (English) Zbl 1507.68224 Chlebus, Bogdan S. (ed.) et al., Fundamentals of computation theory. 11th international symposium, FCT ’97, Jagiellonian Univ., Kraków, Poland, September 1–3, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1279, 129-137 (1997). MSC: 68R10 68M14 68W15 PDFBibTeX XMLCite \textit{A. Calabrese}, Lect. Notes Comput. Sci. 1279, 129--137 (1997; Zbl 1507.68224) Full Text: DOI
Prömel, Hans Jürgen; Steger, Angelika RNC-approximation algorithms for the Steiner problem. (English) Zbl 1498.68213 Reischuk, Rüdiger (ed.) et al., STACS 97. 14th annual symposium on theoretical aspects of computer science. Lübeck, Germany, February 27 – March 1, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1200, 559-570 (1997). MSC: 68R10 05C65 68W20 68W25 PDFBibTeX XMLCite \textit{H. J. Prömel} and \textit{A. Steger}, Lect. Notes Comput. Sci. 1200, 559--570 (1997; Zbl 1498.68213) Full Text: DOI
Auletta, Vincenzo; Parente, Mimmo Better algorithms for minimum weight vertex-connectivity problems. (English) Zbl 1498.68198 Reischuk, Rüdiger (ed.) et al., STACS 97. 14th annual symposium on theoretical aspects of computer science. Lübeck, Germany, February 27 – March 1, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1200, 547-558 (1997). MSC: 68R10 05C40 68W25 PDFBibTeX XMLCite \textit{V. Auletta} and \textit{M. Parente}, Lect. Notes Comput. Sci. 1200, 547--558 (1997; Zbl 1498.68198) Full Text: DOI
Feldmann, Rainer; Monien, Burkhard; Mysliwietz, Peter; Tschöke, Stefan A better upper bound on the bisection width of de Bruijn networks (extended abstract). (English) Zbl 1498.68203 Reischuk, Rüdiger (ed.) et al., STACS 97. 14th annual symposium on theoretical aspects of computer science. Lübeck, Germany, February 27 – March 1, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1200, 511-522 (1997). MSC: 68R10 05C70 PDFBibTeX XMLCite \textit{R. Feldmann} et al., Lect. Notes Comput. Sci. 1200, 511--522 (1997; Zbl 1498.68203) Full Text: DOI
Dahlhaus, Elias Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs. (English) Zbl 1498.68199 Reischuk, Rüdiger (ed.) et al., STACS 97. 14th annual symposium on theoretical aspects of computer science. Lübeck, Germany, February 27 – March 1, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1200, 487-498 (1997). MSC: 68R10 68W05 68W10 68W40 PDFBibTeX XMLCite \textit{E. Dahlhaus}, Lect. Notes Comput. Sci. 1200, 487--498 (1997; Zbl 1498.68199) Full Text: DOI
Ruppert, Eric Finding the \(k\) shortest paths in parallel. (English) Zbl 1498.68215 Reischuk, Rüdiger (ed.) et al., STACS 97. 14th annual symposium on theoretical aspects of computer science. Lübeck, Germany, February 27 – March 1, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1200, 475-486 (1997). MSC: 68R10 68P05 68W10 PDFBibTeX XMLCite \textit{E. Ruppert}, Lect. Notes Comput. Sci. 1200, 475--486 (1997; Zbl 1498.68215) Full Text: DOI
Flammini, Michele Deadlock-free interval routing schemes. (English) Zbl 1498.68020 Reischuk, Rüdiger (ed.) et al., STACS 97. 14th annual symposium on theoretical aspects of computer science. Lübeck, Germany, February 27 – March 1, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1200, 351-362 (1997). MSC: 68M10 68R10 90C35 PDFBibTeX XMLCite \textit{M. Flammini}, Lect. Notes Comput. Sci. 1200, 351--362 (1997; Zbl 1498.68020) Full Text: DOI
Dietzfelbinger, Martin Gossiping and broadcasting versus computing functions in networks. (English) Zbl 1498.68019 Reischuk, Rüdiger (ed.) et al., STACS 97. 14th annual symposium on theoretical aspects of computer science. Lübeck, Germany, February 27 – March 1, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1200, 189-200 (1997). MSC: 68M10 68R10 PDFBibTeX XMLCite \textit{M. Dietzfelbinger}, Lect. Notes Comput. Sci. 1200, 189--200 (1997; Zbl 1498.68019) Full Text: DOI
Franciosa, Paolo Giulio; Frigioni, Daniele; Giaccio, Roberto Semi-dynamic shortest paths and breadth-first search in digraphs. (English) Zbl 1498.68089 Reischuk, Rüdiger (ed.) et al., STACS 97. 14th annual symposium on theoretical aspects of computer science. Lübeck, Germany, February 27 – March 1, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1200, 33-46 (1997). MSC: 68P05 68R10 PDFBibTeX XMLCite \textit{P. G. Franciosa} et al., Lect. Notes Comput. Sci. 1200, 33--46 (1997; Zbl 1498.68089) Full Text: DOI
Hershberger, John; Suri, Subhash Efficient breakout routing in printed circuit boards (extended abstract). (English) Zbl 1497.68381 Dehne, Frank (ed.) et al., Algorithms and data structures. 5th international workshop, WADS ’97, Halifax, Nova Scotia, Canada, August 6–8, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1272, 462-471 (1997). MSC: 68R10 68W40 PDFBibTeX XMLCite \textit{J. Hershberger} and \textit{S. Suri}, Lect. Notes Comput. Sci. 1272, 462--471 (1997; Zbl 1497.68381) Full Text: DOI
Ramnath, Sarnath; Shen, Hong A centroid labelling technique and its application to path selection in trees. (English) Zbl 1497.68393 Dehne, Frank (ed.) et al., Algorithms and data structures. 5th international workshop, WADS ’97, Halifax, Nova Scotia, Canada, August 6–8, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1272, 368-377 (1997). MSC: 68R10 05C05 68P05 68W10 PDFBibTeX XMLCite \textit{S. Ramnath} and \textit{H. Shen}, Lect. Notes Comput. Sci. 1272, 368--377 (1997; Zbl 1497.68393) Full Text: DOI
Papakostas, Achilleas; Tollis, Ioannis G. Orthogonal drawing of high degree graphs with small area and few bends. (English) Zbl 1497.68392 Dehne, Frank (ed.) et al., Algorithms and data structures. 5th international workshop, WADS ’97, Halifax, Nova Scotia, Canada, August 6–8, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1272, 354-367 (1997). MSC: 68R10 PDFBibTeX XMLCite \textit{A. Papakostas} and \textit{I. G. Tollis}, Lect. Notes Comput. Sci. 1272, 354--367 (1997; Zbl 1497.68392) Full Text: DOI
Kwek, Stephen On a simple depth-first search strategy for exploring unknown graphs. (English) Zbl 1509.68278 Dehne, Frank (ed.) et al., Algorithms and data structures. 5th international workshop, WADS ’97, Halifax, Nova Scotia, Canada, August 6–8, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1272, 345-353 (1997). MSC: 68T40 68R10 68T20 PDFBibTeX XMLCite \textit{S. Kwek}, Lect. Notes Comput. Sci. 1272, 345--353 (1997; Zbl 1509.68278) Full Text: DOI
Bertolazzi, Paola; Di Battista, Giuseppe; Didimo, Walter Computing orthogonal drawings with the minimum number of bends. (English) Zbl 1497.68367 Dehne, Frank (ed.) et al., Algorithms and data structures. 5th international workshop, WADS ’97, Halifax, Nova Scotia, Canada, August 6–8, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1272, 331-344 (1997). MSC: 68R10 05C10 05C85 PDFBibTeX XMLCite \textit{P. Bertolazzi} et al., Lect. Notes Comput. Sci. 1272, 331--344 (1997; Zbl 1497.68367) Full Text: DOI
Narasimhan, Giri On Hamiltonian triangulations in simple polygons (extended abstract). (English) Zbl 1497.68536 Dehne, Frank (ed.) et al., Algorithms and data structures. 5th international workshop, WADS ’97, Halifax, Nova Scotia, Canada, August 6–8, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1272, 321-330 (1997). MSC: 68U05 05C45 68R10 PDFBibTeX XMLCite \textit{G. Narasimhan}, Lect. Notes Comput. Sci. 1272, 321--330 (1997; Zbl 1497.68536) Full Text: DOI
Shahrokhi, Farhad; Sýkora, Ondrej; Székely, László A.; Vrt’o, Imrich On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem. (English) Zbl 1497.68397 Dehne, Frank (ed.) et al., Algorithms and data structures. 5th international workshop, WADS ’97, Halifax, Nova Scotia, Canada, August 6–8, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1272, 55-68 (1997). MSC: 68R10 05C07 05C22 05C85 68W25 68W40 PDFBibTeX XMLCite \textit{F. Shahrokhi} et al., Lect. Notes Comput. Sci. 1272, 55--68 (1997; Zbl 1497.68397) Full Text: DOI
Alstrup, Stephen; Lauridsen, Peter W.; Sommerlund, Peer; Thorup, Mikkel Finding cores of limited length. (English) Zbl 1517.68270 Dehne, Frank (ed.) et al., Algorithms and data structures. 5th international workshop, WADS ’97, Halifax, Nova Scotia, Canada, August 6–8, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1272, 45-54 (1997). MSC: 68R10 05C05 05C85 68W05 68W40 PDFBibTeX XMLCite \textit{S. Alstrup} et al., Lect. Notes Comput. Sci. 1272, 45--54 (1997; Zbl 1517.68270) Full Text: DOI
Snoeyink, Jack; van Kreveld, Marc Linear-time reconstruction of Delaunay triangulations with applications. (English) Zbl 1477.68493 Burkard, Rainer (ed.) et al., Algorithms – ESA ’97. 5th annual European symposium, Graz, Austria, September 15–17, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1284, 459-471 (1997). MSC: 68U05 68P05 68R10 PDFBibTeX XMLCite \textit{J. Snoeyink} and \textit{M. van Kreveld}, Lect. Notes Comput. Sci. 1284, 459--471 (1997; Zbl 1477.68493) Full Text: DOI
Nolte, Andreas; Schrader, Rainer Coloring in sublinear time. (English) Zbl 1477.68243 Burkard, Rainer (ed.) et al., Algorithms – ESA ’97. 5th annual European symposium, Graz, Austria, September 15–17, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1284, 388-401 (1997). MSC: 68R10 05C15 05C80 05C85 68W20 68W40 PDFBibTeX XMLCite \textit{A. Nolte} and \textit{R. Schrader}, Lect. Notes Comput. Sci. 1284, 388--401 (1997; Zbl 1477.68243) Full Text: DOI
Krznaric, Drago; Levcopoulos, Christos; Nilsson, Bengt J. Minimum spanning trees in \(d\) dimensions. (English) Zbl 1477.68238 Burkard, Rainer (ed.) et al., Algorithms – ESA ’97. 5th annual European symposium, Graz, Austria, September 15–17, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1284, 341-349 (1997). MSC: 68R10 05C05 68Q25 68U05 68W05 PDFBibTeX XMLCite \textit{D. Krznaric} et al., Lect. Notes Comput. Sci. 1284, 341--349 (1997; Zbl 1477.68238) Full Text: DOI
Korupolu, Madhukar R.; Ramachandran, Vijaya Quasi-fully dynamic algorithms for two-connectivity, cycle equivalence and related problems. (English) Zbl 1477.68234 Burkard, Rainer (ed.) et al., Algorithms – ESA ’97. 5th annual European symposium, Graz, Austria, September 15–17, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1284, 326-340 (1997). MSC: 68R10 05C40 05C85 68W20 68W40 PDFBibTeX XMLCite \textit{M. R. Korupolu} and \textit{V. Ramachandran}, Lect. Notes Comput. Sci. 1284, 326--340 (1997; Zbl 1477.68234) Full Text: DOI Link
Iwama, Kazuo; Miyano, Eiji Three-dimensional meshes are less powerful than two-dimensional ones in oblivious routing. (English) Zbl 1477.68529 Burkard, Rainer (ed.) et al., Algorithms – ESA ’97. 5th annual European symposium, Graz, Austria, September 15–17, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1284, 284-295 (1997). MSC: 68W10 68R10 68W40 PDFBibTeX XMLCite \textit{K. Iwama} and \textit{E. Miyano}, Lect. Notes Comput. Sci. 1284, 284--295 (1997; Zbl 1477.68529) Full Text: DOI
Grebinski, Vladimir; Kucherov, Gregory Optimal reconstruction of graphs under the additive model. (English) Zbl 1477.68228 Burkard, Rainer (ed.) et al., Algorithms – ESA ’97. 5th annual European symposium, Graz, Austria, September 15–17, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1284, 246-258 (1997). MSC: 68R10 05C50 68P10 PDFBibTeX XMLCite \textit{V. Grebinski} and \textit{G. Kucherov}, Lect. Notes Comput. Sci. 1284, 246--258 (1997; Zbl 1477.68228) Full Text: DOI Link
Frigioni, Daniele; Italiano, Giuseppe F. Dynamically switching vertices in planar graphs (extended abstract). (English) Zbl 1477.68227 Burkard, Rainer (ed.) et al., Algorithms – ESA ’97. 5th annual European symposium, Graz, Austria, September 15–17, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1284, 186-199 (1997). MSC: 68R10 05C10 68W05 PDFBibTeX XMLCite \textit{D. Frigioni} and \textit{G. F. Italiano}, Lect. Notes Comput. Sci. 1284, 186--199 (1997; Zbl 1477.68227) Full Text: DOI
Fößmeier, Ulrich; Kaufmann, Michael Solving rectilinear Steiner tree problems exactly in theory and practice. (English) Zbl 1477.68226 Burkard, Rainer (ed.) et al., Algorithms – ESA ’97. 5th annual European symposium, Graz, Austria, September 15–17, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1284, 171-185 (1997). MSC: 68R10 68U05 68W40 PDFBibTeX XMLCite \textit{U. Fößmeier} and \textit{M. Kaufmann}, Lect. Notes Comput. Sci. 1284, 171--185 (1997; Zbl 1477.68226) Full Text: DOI
Czumaj, Artur; Strothmann, Willy-B. Bounded degree spanning trees (extended abstract). (English) Zbl 1477.68215 Burkard, Rainer (ed.) et al., Algorithms – ESA ’97. 5th annual European symposium, Graz, Austria, September 15–17, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1284, 104-117 (1997). MSC: 68R10 05C05 05C10 05C40 68Q17 68Q25 PDFBibTeX XMLCite \textit{A. Czumaj} and \textit{W.-B. Strothmann}, Lect. Notes Comput. Sci. 1284, 104--117 (1997; Zbl 1477.68215) Full Text: DOI
Brandstädt, Andreas; Chepoi, Victor; Dragan, Feodor Distance approximating trees for chordal and dually chordal graphs (extended abstract). (English) Zbl 1477.68208 Burkard, Rainer (ed.) et al., Algorithms – ESA ’97. 5th annual European symposium, Graz, Austria, September 15–17, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1284, 78-91 (1997). MSC: 68R10 05C05 05C12 68Q25 PDFBibTeX XMLCite \textit{A. Brandstädt} et al., Lect. Notes Comput. Sci. 1284, 78--91 (1997; Zbl 1477.68208) Full Text: DOI
Brandes, Ulrik; Wagner, Dorothea A linear time algorithm for the arc disjoint Menger problem in planar directed graphs (extended abstract). (English) Zbl 1477.68207 Burkard, Rainer (ed.) et al., Algorithms – ESA ’97. 5th annual European symposium, Graz, Austria, September 15–17, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1284, 64-77 (1997). MSC: 68R10 05C10 05C20 05C38 05C85 68W05 68W40 PDFBibTeX XMLCite \textit{U. Brandes} and \textit{D. Wagner}, Lect. Notes Comput. Sci. 1284, 64--77 (1997; Zbl 1477.68207) Full Text: DOI
Biedl, Therese C.; Kaufmann, Michael Area-efficient static and incremental graph drawings. (English) Zbl 1477.68201 Burkard, Rainer (ed.) et al., Algorithms – ESA ’97. 5th annual European symposium, Graz, Austria, September 15–17, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1284, 37-52 (1997). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{T. C. Biedl} and \textit{M. Kaufmann}, Lect. Notes Comput. Sci. 1284, 37--52 (1997; Zbl 1477.68201) Full Text: DOI
Huang, Shing-Tsaan; Wuu, Lih-Chyau Self-stabilizing token circulation in uniform networks. (English) Zbl 1448.68047 Distrib. Comput. 10, No. 4, 181-187 (1997). MSC: 68M10 68M12 68M14 68M15 68R10 PDFBibTeX XMLCite \textit{S.-T. Huang} and \textit{L.-C. Wuu}, Distrib. Comput. 10, No. 4, 181--187 (1997; Zbl 1448.68047) Full Text: DOI
Ghosh, Sukumar; Gupta, Arobinda; Pemmaraju, Sriram V. A self-stabilizing algorithm for the maximum flow problem. (English) Zbl 1448.68470 Distrib. Comput. 10, No. 4, 167-180 (1997). MSC: 68W15 68M14 68M15 68R10 90C27 PDFBibTeX XMLCite \textit{S. Ghosh} et al., Distrib. Comput. 10, No. 4, 167--180 (1997; Zbl 1448.68470) Full Text: DOI
Broersma, Hajo; Kloks, Ton; Kratsch, Dieter; Müller, Haiko Independent sets in asteroidal triple-free graphs. (English) Zbl 1401.05278 Degano, Pierpaolo (ed.) et al., Automata, languages and programming. 24th international colloquium, ICALP ’97, Bologna, Italy, July 7–11, 1997. Proceedings. Berlin: Springer-Verlag (ISBN 978-3-540-63165-1/pbk; 978-3-540-69194-5/ebook). Lecture Notes in Computer Science 1256, 760-770 (1997). MSC: 05C85 05C69 68R10 68W40 PDFBibTeX XMLCite \textit{H. Broersma} et al., Lect. Notes Comput. Sci. 1256, 760--770 (1997; Zbl 1401.05278) Full Text: DOI
Fujito, Toshihiro A primal-dual approach to approximation of node-deletion problems for matroidal properties. (English) Zbl 1401.68244 Degano, Pierpaolo (ed.) et al., Automata, languages and programming. 24th international colloquium, ICALP ’97, Bologna, Italy, July 7–11, 1997. Proceedings. Berlin: Springer-Verlag (ISBN 978-3-540-63165-1/pbk; 978-3-540-69194-5/ebook). Lecture Notes in Computer Science 1256, 749-759 (1997). MSC: 68R10 05B35 68W25 PDFBibTeX XMLCite \textit{T. Fujito}, Lect. Notes Comput. Sci. 1256, 749--759 (1997; Zbl 1401.68244) Full Text: DOI
Bar-Noy, Amotz; Kortsarz, Guy The minimum color sum of bipartite graphs. (English) Zbl 1401.68242 Degano, Pierpaolo (ed.) et al., Automata, languages and programming. 24th international colloquium, ICALP ’97, Bologna, Italy, July 7–11, 1997. Proceedings. Berlin: Springer-Verlag (ISBN 978-3-540-63165-1/pbk; 978-3-540-69194-5/ebook). Lecture Notes in Computer Science 1256, 738-748 (1997). MSC: 68R10 05C15 68Q17 68Q25 68W25 PDFBibTeX XMLCite \textit{A. Bar-Noy} and \textit{G. Kortsarz}, Lect. Notes Comput. Sci. 1256, 738--748 (1997; Zbl 1401.68242) Full Text: DOI
Jansen, Klaus Approximation results for the optimum cost chromatic partition problem. (English) Zbl 1401.68353 Degano, Pierpaolo (ed.) et al., Automata, languages and programming. 24th international colloquium, ICALP ’97, Bologna, Italy, July 7–11, 1997. Proceedings. Berlin: Springer-Verlag (ISBN 978-3-540-63165-1/pbk; 978-3-540-69194-5/ebook). Lecture Notes in Computer Science 1256, 727-737 (1997). MSC: 68W05 05C15 05C85 68R10 68W25 PDFBibTeX XMLCite \textit{K. Jansen}, Lect. Notes Comput. Sci. 1256, 727--737 (1997; Zbl 1401.68353) Full Text: DOI
Henzinger, Monika R.; King, Valerie Maintaining minimum spanning trees in dynamic graphs. (English) Zbl 1401.68249 Degano, Pierpaolo (ed.) et al., Automata, languages and programming. 24th international colloquium, ICALP ’97, Bologna, Italy, July 7–11, 1997. Proceedings. Berlin: Springer-Verlag (ISBN 978-3-540-63165-1/pbk; 978-3-540-69194-5/ebook). Lecture Notes in Computer Science 1256, 594-604 (1997). MSC: 68R10 05C85 68W40 PDFBibTeX XMLCite \textit{M. R. Henzinger} and \textit{V. King}, Lect. Notes Comput. Sci. 1256, 594--604 (1997; Zbl 1401.68249) Full Text: DOI
Eilam, Tamar; Flammini, Michele; Zaks, Shmuel A complete characterization of the path layout construction problem for ATM networks with given hop count and load. (English) Zbl 1401.68243 Degano, Pierpaolo (ed.) et al., Automata, languages and programming. 24th international colloquium, ICALP ’97, Bologna, Italy, July 7–11, 1997. Proceedings. Berlin: Springer-Verlag (ISBN 978-3-540-63165-1/pbk; 978-3-540-69194-5/ebook). Lecture Notes in Computer Science 1256, 527-537 (1997). MSC: 68R10 68Q25 PDFBibTeX XMLCite \textit{T. Eilam} et al., Lect. Notes Comput. Sci. 1256, 527--537 (1997; Zbl 1401.68243) Full Text: DOI
Gargano, Luisa; Hell, Pavol; Perennes, Stephane Colouring paths in directed symmetric trees with applications to WDM routing. (English) Zbl 1401.68245 Degano, Pierpaolo (ed.) et al., Automata, languages and programming. 24th international colloquium, ICALP ’97, Bologna, Italy, July 7–11, 1997. Proceedings. Berlin: Springer-Verlag (ISBN 978-3-540-63165-1/pbk; 978-3-540-69194-5/ebook). Lecture Notes in Computer Science 1256, 505-515 (1997). MSC: 68R10 05C15 05C85 90B18 PDFBibTeX XMLCite \textit{L. Gargano} et al., Lect. Notes Comput. Sci. 1256, 505--515 (1997; Zbl 1401.68245) Full Text: DOI
Kaklamanis, Christos; Persiano, Pino; Erlebach, Thomas; Jansen, Klaus Constrained bipartite edge coloring with applications to wavelength routing. (English) Zbl 1401.68251 Degano, Pierpaolo (ed.) et al., Automata, languages and programming. 24th international colloquium, ICALP ’97, Bologna, Italy, July 7–11, 1997. Proceedings. Berlin: Springer-Verlag (ISBN 978-3-540-63165-1/pbk; 978-3-540-69194-5/ebook). Lecture Notes in Computer Science 1256, 493-504 (1997). MSC: 68R10 05C15 05C85 90B18 PDFBibTeX XMLCite \textit{C. Kaklamanis} et al., Lect. Notes Comput. Sci. 1256, 493--504 (1997; Zbl 1401.68251) Full Text: DOI
Schwiegelshohn, Uwe; Thiele, Lothar Periodic and non-periodic min-max equations. (English) Zbl 1401.68257 Degano, Pierpaolo (ed.) et al., Automata, languages and programming. 24th international colloquium, ICALP ’97, Bologna, Italy, July 7–11, 1997. Proceedings. Berlin: Springer-Verlag (ISBN 978-3-540-63165-1/pbk; 978-3-540-69194-5/ebook). Lecture Notes in Computer Science 1256, 379-389 (1997). MSC: 68R10 05C22 05C85 90C35 PDFBibTeX XMLCite \textit{U. Schwiegelshohn} and \textit{L. Thiele}, Lect. Notes Comput. Sci. 1256, 379--389 (1997; Zbl 1401.68257) Full Text: DOI
Hagerup, Torben Dynamic algorithms for graphs of bounded treewidth. (English) Zbl 1401.68248 Degano, Pierpaolo (ed.) et al., Automata, languages and programming. 24th international colloquium, ICALP ’97, Bologna, Italy, July 7–11, 1997. Proceedings. Berlin: Springer-Verlag (ISBN 978-3-540-63165-1/pbk; 978-3-540-69194-5/ebook). Lecture Notes in Computer Science 1256, 292-302 (1997). MSC: 68R10 03B70 05C78 05C85 68P05 PDFBibTeX XMLCite \textit{T. Hagerup}, Lect. Notes Comput. Sci. 1256, 292--302 (1997; Zbl 1401.68248) Full Text: DOI
Alstrup, Stephen; Holm, Jacob; de Lichtenberg, Kristian; Thorup, Mikkel Minimizing diameters of dynamic trees. (English) Zbl 1401.68240 Degano, Pierpaolo (ed.) et al., Automata, languages and programming. 24th international colloquium, ICALP ’97, Bologna, Italy, July 7–11, 1997. Proceedings. Berlin: Springer-Verlag (ISBN 978-3-540-63165-1/pbk; 978-3-540-69194-5/ebook). Lecture Notes in Computer Science 1256, 270-280 (1997). MSC: 68R10 68Q25 PDFBibTeX XMLCite \textit{S. Alstrup} et al., Lect. Notes Comput. Sci. 1256, 270--280 (1997; Zbl 1401.68240) Full Text: DOI
Asperti, Andrea; Laneve, Cosimo On the dynamics of sharing graphs. (English) Zbl 1401.68029 Degano, Pierpaolo (ed.) et al., Automata, languages and programming. 24th international colloquium, ICALP ’97, Bologna, Italy, July 7–11, 1997. Proceedings. Berlin: Springer-Verlag (ISBN 978-3-540-63165-1/pbk; 978-3-540-69194-5/ebook). Lecture Notes in Computer Science 1256, 259-269 (1997). MSC: 68N18 68Q25 68R10 PDFBibTeX XMLCite \textit{A. Asperti} and \textit{C. Laneve}, Lect. Notes Comput. Sci. 1256, 259--269 (1997; Zbl 1401.68029) Full Text: DOI
Boldi, Paolo; Vigna, Sebastiano Minimal sense of direction and decision problems for Cayley graphs. (English) Zbl 1338.68211 Inf. Process. Lett. 64, No. 6, 299-303 (1997). MSC: 68R10 68Q25 PDFBibTeX XMLCite \textit{P. Boldi} and \textit{S. Vigna}, Inf. Process. Lett. 64, No. 6, 299--303 (1997; Zbl 1338.68211) Full Text: DOI Link
Bagchi, Anindo Route selection with multiple metrics. (English) Zbl 1337.68197 Inf. Process. Lett. 64, No. 4, 203-205 (1997). MSC: 68R10 68M10 PDFBibTeX XMLCite \textit{A. Bagchi}, Inf. Process. Lett. 64, No. 4, 203--205 (1997; Zbl 1337.68197) Full Text: DOI
Hakimi, S. Louis; Schmeichel, Edward F.; Young, Neal E. Orienting graphs to optimize reachability. (English) Zbl 1337.68130 Inf. Process. Lett. 63, No. 5, 229-235 (1997). MSC: 68Q25 05C20 05C40 05C85 68Q17 68R10 PDFBibTeX XMLCite \textit{S. L. Hakimi} et al., Inf. Process. Lett. 63, No. 5, 229--235 (1997; Zbl 1337.68130) Full Text: DOI
King, Valerie; Poon, Chung Keung; Ramachandran, Vijaya; Sinha, Santanu An optimal EREW PRAM algorithm for minimum spanning tree verification. (English) Zbl 1337.68285 Inf. Process. Lett. 62, No. 3, 153-159 (1997). MSC: 68W10 68R10 PDFBibTeX XMLCite \textit{V. King} et al., Inf. Process. Lett. 62, No. 3, 153--159 (1997; Zbl 1337.68285) Full Text: DOI
Eppstein, David Dynamic connectivity in digital images. (English) Zbl 1337.68282 Inf. Process. Lett. 62, No. 3, 121-126 (1997). MSC: 68U10 68Q25 68R10 68T20 91-08 91A05 PDFBibTeX XMLCite \textit{D. Eppstein}, Inf. Process. Lett. 62, No. 3, 121--126 (1997; Zbl 1337.68282) Full Text: DOI
Flocchini, Paola Minimal sense of direction in regular networks. (English) Zbl 1337.68203 Inf. Process. Lett. 61, No. 6, 331-338 (1997). MSC: 68R10 05C75 05C78 05C85 PDFBibTeX XMLCite \textit{P. Flocchini}, Inf. Process. Lett. 61, No. 6, 331--338 (1997; Zbl 1337.68203) Full Text: DOI
Chao, H. S.; Hsu, F. R.; Lee, R. C. T. An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs. (English) Zbl 1337.68284 Inf. Process. Lett. 61, No. 6, 311-316 (1997). MSC: 68W10 68P05 68R10 PDFBibTeX XMLCite \textit{H. S. Chao} et al., Inf. Process. Lett. 61, No. 6, 311--316 (1997; Zbl 1337.68284) Full Text: DOI
Friš, Ivan; Havel, Ivan; Liebl, Petr The diameter of the cube-connected cycles. (English) Zbl 1337.68204 Inf. Process. Lett. 61, No. 3, 157-160 (1997). MSC: 68R10 05C38 PDFBibTeX XMLCite \textit{I. Friš} et al., Inf. Process. Lett. 61, No. 3, 157--160 (1997; Zbl 1337.68204) Full Text: DOI
Hasunuma, Toru; Shibata, Yukio Containment of butterflies in networks constructed by the line digraph operation. (English) Zbl 1337.68209 Inf. Process. Lett. 61, No. 1, 25-30 (1997). MSC: 68R10 05C20 05C76 PDFBibTeX XMLCite \textit{T. Hasunuma} and \textit{Y. Shibata}, Inf. Process. Lett. 61, No. 1, 25--30 (1997; Zbl 1337.68209) Full Text: DOI
Lin, Min-Sheng; Chen, Deng-Jyi The computational complexity of the reliability problem on distributed systems. (English) Zbl 1337.68043 Inf. Process. Lett. 64, No. 3, 143-147 (1997). MSC: 68M15 68M14 68Q17 68R10 PDFBibTeX XMLCite \textit{M.-S. Lin} and \textit{D.-J. Chen}, Inf. Process. Lett. 64, No. 3, 143--147 (1997; Zbl 1337.68043) Full Text: DOI
Chang, Hung-Yi; Chen, Rong-Jaye Embedding cycles in IEH graphs. (English) Zbl 1337.68199 Inf. Process. Lett. 64, No. 1, 23-27 (1997). MSC: 68R10 05C38 05C45 PDFBibTeX XMLCite \textit{H.-Y. Chang} and \textit{R.-J. Chen}, Inf. Process. Lett. 64, No. 1, 23--27 (1997; Zbl 1337.68199) Full Text: DOI
Kim, Sung Kwon Logarithmic width, linear area upward drawing of AVL trees. (English) Zbl 1336.68202 Inf. Process. Lett. 63, No. 6, 303-307 (1997). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{S. K. Kim}, Inf. Process. Lett. 63, No. 6, 303--307 (1997; Zbl 1336.68202) Full Text: DOI
Calamoneri, Tiziana; Sterbini, Andrea 3D straight-line grid drawing of 4-colorable graphs. (English) Zbl 1337.68266 Inf. Process. Lett. 63, No. 2, 97-102 (1997). MSC: 68U05 05C15 68R10 PDFBibTeX XMLCite \textit{T. Calamoneri} and \textit{A. Sterbini}, Inf. Process. Lett. 63, No. 2, 97--102 (1997; Zbl 1337.68266) Full Text: DOI
Flocchini, Paola; Mans, Bernard; Santoro, Nicola On the impact of sense of direction on message complexity. (English) Zbl 1336.68197 Inf. Process. Lett. 63, No. 1, 23-31 (1997). MSC: 68R10 05C85 68Q25 68W15 PDFBibTeX XMLCite \textit{P. Flocchini} et al., Inf. Process. Lett. 63, No. 1, 23--31 (1997; Zbl 1336.68197) Full Text: DOI
Nakano, Shin-Ichi; Saidur Rahman, Md.; Nishizeki, Takao A linear-time algorithm for four-partitioning four-connected planar graphs. (English) Zbl 1336.05136 Inf. Process. Lett. 62, No. 6, 315-322 (1997). MSC: 05C85 05C40 05C70 68Q25 68R10 PDFBibTeX XMLCite \textit{S.-I. Nakano} et al., Inf. Process. Lett. 62, No. 6, 315--322 (1997; Zbl 1336.05136) Full Text: DOI