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	Hilfe

Suche: Series=LNCS AND Volume=314

• Distributed parallelism of graph transformations
  H. Ehrig, P. Boehm, U. Hummert, M. Löwe
  Lecture Notes in Computer Science 314, 1988, pp. 1-19
• A PrT-net representation for graph-grammars
  E. Montonen, L. Ojala, T. Tuuliniemi
  Lecture Notes in Computer Science 314, 1988, pp. 20-31
• Pretty patterns produced by hyperedge replacement
  A. Habel, H.-J. Kreowski
  Lecture Notes in Computer Science 314, 1988, pp. 32-45
• Graph languages defined by systems of forbidden structures: A survey
  V. Blödel, F. Wankmüller
  Lecture Notes in Computer Science 314, 1988, pp. 46-58
• A sweepcircle algorithm for Voronoi diagrams (extended abstract)
  F. Dehne, R. Klein
  Lecture Notes in Computer Science 314, 1988, pp. 59-69
• Competitive location in the L1 and L{INF} metrics
  R. Govindan, P. Rangan
  Lecture Notes in Computer Science 314, 1988, pp. 70-83
• Priority search trees in secondary memory (extended abstract)
  Ch. Icking, R. Klein, Th. Ottmann
  Lecture Notes in Computer Science 314, 1988, pp. 84-93
• On the analysis of grid structures for spatial objects of non-zero size
  Th. Rottke, H.-W. Six, P. Widmayer
  Lecture Notes in Computer Science 314, 1988, pp. 94-105
• Maintenance of transitive closures and transitive reductions of graphs (extended abstract)
  J.A. La Poutré, J. van Leeuwen
  Lecture Notes in Computer Science 314, 1988, pp. 106-120
• Upward drawings of acyclic digraphs
  G. Di Battista, R. Tamassia
  Lecture Notes in Computer Science 314, 1988, pp. 121-133
• Approximate counting, uniform generation and rapidly mixing Markov chains (extended abstract)
  A. Sinclair, M. Jerrum
  Lecture Notes in Computer Science 314, 1988, pp. 134-148
• On chaotic behaviour of some NP-complete problems
  J. Perl
  Lecture Notes in Computer Science 314, 1988, pp. 149-161
• External labeling and algorithms for hierarchic networks
  A. Perko
  Lecture Notes in Computer Science 314, 1988, pp. 162-170
• Designing gamma-acyclic database schemes using decomposition and augmentation techniques
  D. Seipel, D. Ruland
  Lecture Notes in Computer Science 314, 1988, pp. 171-185
• Graph-theoretic tools and their use in a practical distributed operating system design case
  H.F. Wedde, D.C. Daniels
  Lecture Notes in Computer Science 314, 1988, pp. 186-205
• Development of several reachability algorithms for directed graphs
  R. Berghammer, H. Ehler, H. Zierer
  Lecture Notes in Computer Science 314, 1988, pp. 206-218
• On integration mechanisms within a graph-based software development environment
  C. Lewerentz, M. Nagl, B. Westfechtel
  Lecture Notes in Computer Science 314, 1988, pp. 219-229
• Restructuring aspect graphs into aspect- and cell-equivalence classes for use in computer vision
  J. Stewman, L. Stark, K. Bowyer
  Lecture Notes in Computer Science 314, 1988, pp. 230-241
• Automatic crystal chemical classification of silicates using direction-labeled graphs
  K. Goetzke, H.-J. Klein, P. Kandzia
  Lecture Notes in Computer Science 314, 1988, pp. 242-254