Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen [1]	Hilfe

Suche: Series=LNCS AND Volume=790

• The folded Petersen network: A new versatile multiprocessor interconnection topology
  Sabine R. Öhring, Sajal K. Das
  Lecture Notes in Computer Science 790, 1993, pp. 301-314
• Fast load balancing in Cayley graphs and in circuits
  Jacques E. Boillat
  Lecture Notes in Computer Science 790, 1993, pp. 315-326
• Concurrent flows and packet routing in Cayley graphs
  Farhad Shahrokhi, Laszló A. Székely
  Lecture Notes in Computer Science 790, 1993, pp. 327-337
• On multi-label linear interval routing schemes
  Evangelos Kranakis, Danny Krizanc, S.S. Ravi
  Lecture Notes in Computer Science 790, 1993, pp. 338-349
• An 'All Pairs Shortest Paths' distributed algorithm using 2n^2 messages
  S. Haldar
  Lecture Notes in Computer Science 790, 1993, pp. 350-363
• Linear layouts of generalized hypercubes
  Koji Nakano
  Lecture Notes in Computer Science 790, 1993, pp. 364-375
• Graph ear decompositions and graph embeddings
  Jianer Chen, Saroja P. Kanchi
  Lecture Notes in Computer Science 790, 1993, pp. 376-387
• Improved bounds for the crossing numbers on surfaces of genus g
  Farhad Shahrokhi, Laszló A. Székely, Ondrej Sýkora, Imrich Vrt'o
  Lecture Notes in Computer Science 790, 1993, pp. 388-395
• Two algorithms for finding rectangular duals of planar graphs
  Goos Kant, Xin He
  Lecture Notes in Computer Science 790, 1993, pp. 396-410
• A more compact visibility representation
  Goos Kant
  Lecture Notes in Computer Science 790, 1993, pp. 411-424