Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=570

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

Approximating treewidth, pathwidth, and minimum elimination tree height
Hans L. Bodlaender, John R. Gilbert, Hjálmtýr Hafsteinsson, Ton Kloks
Lecture Notes in Computer Science 570, 1992, pp. 1-12
Monadic second-order evaluations on tree-decomposable graphs
B. Courcelle, M. Mosbah
Lecture Notes in Computer Science 570, 1992, pp. 13-24
Optimal embedding of complete binary trees into lines and grids
R. Heckmann, R. Klasing, B. Monien, W. Unger
Lecture Notes in Computer Science 570, 1992, pp. 25-35
Graph rewriting systems and their application to network reliability analysis
Yasuyoshi Okada, Masahiro Hayashi
Lecture Notes in Computer Science 570, 1992, pp. 36-47
Nondeterministic control structures for graph rewriting systems
Albert Zündorf, Andy Schürr
Lecture Notes in Computer Science 570, 1992, pp. 48-62
A language for generic graph-transformations
Marc Andries, Jan Paredaens
Lecture Notes in Computer Science 570, 1992, pp. 63-74
Attributed elementary programmed graph grammars
Rudolf Freund, Brigitte Haberstroh
Lecture Notes in Computer Science 570, 1992, pp. 75-84
The complexity of appoximating the class Steiner tree problem
Edmund Ihler
Lecture Notes in Computer Science 570, 1992, pp. 85-96
On complexity of some chain and antichain partition problems
Zbigniew Lonc
Lecture Notes in Computer Science 570, 1991, pp. 97-104
Tight bounds for the rectangular art gallery problem
J. Czyzowicz, E. Rivera-Campo, N. Santoro, J. Urrutia, J. Zaks
Lecture Notes in Computer Science 570, 1991, pp. 105-112
Voronoi diagrams of moving points in the plane
Leonidas J. Guibas, Joseph S.B. Mitchell, Thomas Roos
Lecture Notes in Computer Science 570, 1991, pp. 113-125
Using maximal independent sets to solve problems in parallel
Takayoshi Shoudai, Satoru Miyano
Lecture Notes in Computer Science 570, 1992, pp. 126-134
Fast parallel algorithms for coloring random graphs
Zvi M. Kedem, Krishna V. Palem, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis
Lecture Notes in Computer Science 570, 1991, pp. 135-147
Optimal vertex ordering of a graph and its application to symmetry detection
X.Y. Jiang, H. Bunke
Lecture Notes in Computer Science 570, 1992, pp. 148-158
Edge separators for graphs of bounded genus with applications
Ondrej Sýkora, Imrich Vrt̑o
Lecture Notes in Computer Science 570, 1991, pp. 159-168
Line digraph iterations and the spread concept - with application to graph theory, fault tolerance, and routing
Ding-Zhu Du, Yuh-Dauh Lyuu, D. Frank Hsu
Lecture Notes in Computer Science 570, 1991, pp. 169-179
A generalized encryption scheme based on random graphs
Ludȇk Kuc̑era
Lecture Notes in Computer Science 570, 1992, pp. 180-186
Dynamic algorithms for shortest paths in planar graphs
Esteban Feuerstein, Alberto Marchetti-Spaccamela
Lecture Notes in Computer Science 570, 1992, pp. 187-197
Complete problems for logspace involving lexicographic first paths in graphs
Iain A. Stewart
Lecture Notes in Computer Science 570, 1992, pp. 198-208
A new upper bound on the complexity of the all pairs shortest path problem
Tadao Takaoka
Lecture Notes in Computer Science 570, 1992, pp. 209-213
On the crossing number of the hypercube and the cube connected cycles
Ondrej Sýkora, Imrich Vrt̑o
Lecture Notes in Computer Science 570, 1992, pp. 214-218
Logic arrays for interval indicator functions
Peter Damaschke
Lecture Notes in Computer Science 570, 1992, pp. 219-225
On the broadcast time of the Butterfly network
Elena Stöhr
Lecture Notes in Computer Science 570, 1992, pp. 226-229
On disjoint cycles
Hans L. Bodlaender
Lecture Notes in Computer Science 570, 1992, pp. 230-238
Short disjoint cycles in cubic bridgeless graphs
Andreas Brandstädt
Lecture Notes in Computer Science 570, 1992, pp. 239-249