Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1017

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

VC-dimensions for graphs
Evangelos Kranakis, Danny Krizanc, Berthold Ruf, Jorge Urrutia, Gerhard J. Woeginger
Lecture Notes in Computer Science 1017, 1995, pp. 1-13
Finding and counting small induced subgraphs efficiently
T. Kloks, D. Kratsch, H. Müller
Lecture Notes in Computer Science 1017, 1995, pp. 14-23
On the isomorphism of graphs with few P_4s
Luitpold Babel, Stephan Olariu
Lecture Notes in Computer Science 1017, 1995, pp. 24-36
A dynamic algorithm for line graph recognition
Daniele Giorgio Degiorgi, Klaus Simon
Lecture Notes in Computer Science 1017, 1995, pp. 37-48
Incremental hive graph
Fabrizio d'Amore, Roberto Giaccio
Lecture Notes in Computer Science 1017, 1995, pp. 49-61
Planarization of graphs embedded on surfaces
Hristo N. Djidjev, Shankar M. Venkatesan
Lecture Notes in Computer Science 1017, 1995, pp. 62-72
Complexity and approximability of certain bicriteria location problems
S.O. Krumke, H. Noltemeier, S.S. Ravi, M.V. Marathe
Lecture Notes in Computer Science 1017, 1995, pp. 73-87
On termination of graph rewriting
Detlef Plump
Lecture Notes in Computer Science 1017, 1995, pp. 88-100
A uniform approach to graph rewriting: The pullback approach
Michel Bauderon
Lecture Notes in Computer Science 1017, 1995, pp. 101-115
Visualizing two- and three-dimensional models of meristematic growth
F. David Fracchia
Lecture Notes in Computer Science 1017, 1995, pp. 116-130
Graph-theoretical methods to construct entity-relationship databases
Sven Hartmann
Lecture Notes in Computer Science 1017, 1995, pp. 131-145
An approximation algorithm for 3-colourability
Ingo Schiermeyer
Lecture Notes in Computer Science 1017, 1995, pp. 146-151
The malleability of TSP_{2Opt}
Sophie Fischer, Leen Torenvliet
Lecture Notes in Computer Science 1017, 1995, pp. 152-166
Non-oblivious local search for graph and hypergraph coloring problems
Paola Alimonti
Lecture Notes in Computer Science 1017, 1995, pp. 167-180
On interval routing schemes and treewidth
Hans L. Bodlaender, Richard B. Tan, Dimitris M. Thilikos, Jan van Leeuwen
Lecture Notes in Computer Science 1017, 1995, pp. 181-196
Highly fault-tolerant routings and diameter vulnerability for generalized hypercube graphs
Koichi Wada, Takaharu Ikeo, Kimio Kawaguchi, Wei Chen
Lecture Notes in Computer Science 1017, 1995, pp. 197-208
Hot-potato routing on multi-dimensional tori
Friedhelm Meyer auf der Heide, Matthias Westermann
Lecture Notes in Computer Science 1017, 1995, pp. 209-221
On devising Boolean routing schemes
Michele Flammini, Giorgio Gambosi, Sandro Salomone
Lecture Notes in Computer Science 1017, 1995, pp. 222-236
Toward a general theory of unicast-based multicast communication
Barbara D. Birchler, Abdol-Hossein Esfahanian, Eric Torng
Lecture Notes in Computer Science 1017, 1995, pp. 237-251
Optimal cutwidths and bisection widths of 2- and 3-dimensional meshes
José Rolim, Ondrej Sýkora, Imrich Vrt'o
Lecture Notes in Computer Science 1017, 1995, pp. 252-264
Searching for faulty leaves in binary trees
Peter Damaschke
Lecture Notes in Computer Science 1017, 1995, pp. 265-274
NC algorithms for partitioning planar graphs into induced forests and approximating NP-hard problems
Zhi-Zhong Chen, Xin He
Lecture Notes in Computer Science 1017, 1995, pp. 275-289
Efficient parallel modular decomposition
Elias Dahlhaus
Lecture Notes in Computer Science 1017, 1995, pp. 290-302
Modular decomposition of hypergraphs
P. Bonizzoni, G. Della Vedova
Lecture Notes in Computer Science 1017, 1995, pp. 303-317
Partition coefficients of acyclic graphs
John L. Pfaltz
Lecture Notes in Computer Science 1017, 1995, pp. 318-332

Seiten 1 2 >