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 [2]	Hilfe

Suche: Series=LNCS AND Volume=1017

• Sub-cubic cost algorithms for the all pairs shortest path problem
  Tadao Takaoka
  Lecture Notes in Computer Science 1017, 1995, pp. 333-343
• Diametral path graphs
  J.S. Deogun, D. Kratsch
  Lecture Notes in Computer Science 1017, 1995, pp. 344-357
• Chordal graphs and their clique graphs
  Philippe Galinier, Michel Habib, Christophe Paul
  Lecture Notes in Computer Science 1017, 1995, pp. 358-371
• A compact data structure and parallel algorithms for permutation graphs
  Jens Gustedt, Michel Morvan, Laurent Viennot
  Lecture Notes in Computer Science 1017, 1995, pp. 372-380
• Homogeneously orderable graphs and the Steiner tree problem
  Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai
  Lecture Notes in Computer Science 1017, 1995, pp. 381-395