Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=484

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

Optimal parallel algorithms for sparse graphs
Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis
Lecture Notes in Computer Science 484, 1991, pp. 1-17
Finding minimally weighted subgraphs
Jürgen Plehn, Bernd Voigt
Lecture Notes in Computer Science 484, 1991, pp. 18-29
On the complexity of some coloring games
Hans L. Bodlaender
Lecture Notes in Computer Science 484, 1991, pp. 30-40
A generalized best-first search method in graphs
Ulrich Huckenbeck, Detlev Ruland
Lecture Notes in Computer Science 484, 1991, pp. 41-60
Avoiding matrix multiplication
Tze-Heng Ma, Jeremy P. Spinrad
Lecture Notes in Computer Science 484, 1991, pp. 61-71
Induced subgraph isomorphism for cographs is NP-complete
Peter Damaschke
Lecture Notes in Computer Science 484, 1991, pp. 72-78
On feedback problems in planar digraphs
Hermann Stamm
Lecture Notes in Computer Science 484, 1991, pp. 79-89
Recognizing binary Hamming graphs in O(n^2\log n) time
Franz Aurenhammer, Johann Hagauer
Lecture Notes in Computer Science 484, 1991, pp. 90-98
Vertex-disjoint trees and boundary single-layer routing
Kuo-Feng Liao, Majid Sarrafzadeh
Lecture Notes in Computer Science 484, 1991, pp. 99-108
Bounds on the quality of approximate solutions to the group Steiner problem
Edmund Ihler
Lecture Notes in Computer Science 484, 1991, pp. 109-118
Two polynomial problems in PLA folding
Claudio Arbib
Lecture Notes in Computer Science 484, 1991, pp. 119-129
The VLSI layout problem in various embedding models
Michael Formann, Frank Wagner
Lecture Notes in Computer Science 484, 1991, pp. 130-139
Approximating the minimum net expansion: Near optimal solutions to circuit partitioning problems
Fillia Makedon, Spyros Tragoudas
Lecture Notes in Computer Science 484, 1991, pp. 140-153
Deterministic message routing in faulty hypercubes
Seshu Madhavapeddy, I. Hal Sudborough
Lecture Notes in Computer Science 484, 1991, pp. 154-169
On complexity of a message-routing strategy for multicomputer systems
Hyeong-Ah Choi, Abdol-Hossein Esfahanian
Lecture Notes in Computer Science 484, 1991, pp. 170-181
Embeddings of treelike graphs into 2-dimensional meshes
Peter Zienicke
Lecture Notes in Computer Science 484, 1991, pp. 182-192
Diagnosis of t/s-diagnosable systems
A. Das, K. Thulasiraman
Lecture Notes in Computer Science 484, 1991, pp. 193-205
Deciding 1-solvability of distributed task is NP-hard
Ofer Biran, Shlomo Moran, Shmuel Zaks
Lecture Notes in Computer Science 484, 1991, pp. 206-220
Remarks on some concurrency measures
Michel Habib, Michel Morvan, Jean-Xavier Rampon
Lecture Notes in Computer Science 484, 1991, pp. 221-238
On the rectilinear art gallery problem - algorithmic aspects
Frank Hoffmann, Michael Kaufmann
Lecture Notes in Computer Science 484, 1991, pp. 239-250
Separation problems and circular arc systems
Paul Fischer, Hans Ulrich Simon
Lecture Notes in Computer Science 484, 1991, pp. 251-259
Genus of orders and lattices
Klaus Reuter, Ivan Rival
Lecture Notes in Computer Science 484, 1991, pp. 260-275
Comparing the expressibility of two languages formed using NP-complete graph operators
Iain A. Stewart
Lecture Notes in Computer Science 484, 1991, pp. 276-290
Decomposition of linear recursive logic programs
Dietmar Seipel
Lecture Notes in Computer Science 484, 1991, pp. 291-310
On the transition graphs of automata and grammars
Didier Caucal, Roland Monfort
Lecture Notes in Computer Science 484, 1991, pp. 311-337

Seiten 1 2 >