Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1197

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

Hypergraphs and decision trees
Andrew C. Yao
Lecture Notes in Computer Science 1197, 1997, pp. 1-1
Improved approximations of independent dominating set in bounded degree graphs
Paola Alimonti, Tiziana Calamoneri
Lecture Notes in Computer Science 1197, 1997, pp. 2-16
A new characterization of P_4-connected graphs
Luitpold Babel, Stephan Olariu
Lecture Notes in Computer Science 1197, 1997, pp. 17-30
Node rewriting in hypergraphs
Michel Bauderon, Hélène Jacquet
Lecture Notes in Computer Science 1197, 1997, pp. 31-43
On \kappa-partitioning the n-cube
Sergej L. Bezrukov
Lecture Notes in Computer Science 1197, 1997, pp. 44-55
Embedding complete binary trees in product graphs
Adrienne Broadwater, Kemal Efe, Antonio Fernández
Lecture Notes in Computer Science 1197, 1997, pp. 56-66
Clique and anticlique partitions of graphs
Krzysztof Bryś, Zbigniew Lonc
Lecture Notes in Computer Science 1197, 1997, pp. 67-72
Optimal parallel routing in star graphs
Chi-Chang Chen, Jianer Chen
Lecture Notes in Computer Science 1197, 1997, pp. 73-84
Counting edges in a dag
Serafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese
Lecture Notes in Computer Science 1197, 1997, pp. 85-100
Closure properties of context-free hyperedge replacement systems
Ornella Ciotti, Francesco Parisi-Presicce
Lecture Notes in Computer Science 1197, 1997, pp. 101-113
Upward drawings of search trees
P. Crescenzi, P. Penna
Lecture Notes in Computer Science 1197, 1997, pp. 114-125
More general parallel tree contraction: Register allocation and broadcasting in a tree
Krzysztof Diks, Torben Hagerup
Lecture Notes in Computer Science 1197, 1997, pp. 126-140
System diagnosis with smallest risk of error
Krzysztof Diks, Andrzej Pelc
Lecture Notes in Computer Science 1197, 1997, pp. 141-150
Efficient algorithms for shortest path queries in planar digraphs
Hristo N. Djidjev
Lecture Notes in Computer Science 1197, 1997, pp. 151-165
LexBFS-orderings and powers of graphs
Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt
Lecture Notes in Computer Science 1197, 1997, pp. 166-180
Efficient Union-Find for planar graphs and other sparse graph classes
Jens Gustedt
Lecture Notes in Computer Science 1197, 1997, pp. 181-195
Switchbox routing in VLSI design: Closing the complexity gap
Stephan Hartmann, Markus W. Schäffter, Andreas S. Schulz
Lecture Notes in Computer Science 1197, 1997, pp. 196-210
Detecting diamond necklaces in labeled dags (a problem from distributed debugging)
Michel Hurfin, Michel Raynal
Lecture Notes in Computer Science 1197, 1997, pp. 211-223
Algebraic graph derivations for graphical calculi
Wolfram Kahl
Lecture Notes in Computer Science 1197, 1997, pp. 224-238
Definability equals recognizability of partial 3-trees
Damon Kaller
Lecture Notes in Computer Science 1197, 1997, pp. 239-253
One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs
Bettina Klinz, Gerhard J. Woeginger
Lecture Notes in Computer Science 1197, 1997, pp. 254-267
Approximate maxima finding of continuous functions under restricted budget
Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, David Peleg
Lecture Notes in Computer Science 1197, 1997, pp. 268-278
The optimal cost chromatic partition problem for trees and interval graphs
Leo G. Kroon, Arunabha Sen, Haiyong Deng, Asim Roy
Lecture Notes in Computer Science 1197, 1997, pp. 279-292
Modifying networks to obtain low cost trees
S.O. Krumke, H. Noltemeier, M.V. Marathe, S.S. Ravi, K.U. Drangmeister
Lecture Notes in Computer Science 1197, 1997, pp. 293-307
On the hardness of allocating frequencies for hybrid networks
Ewa Malesińska, Alessandro Panconesi
Lecture Notes in Computer Science 1197, 1997, pp. 308-322

Seiten 1 2 >