Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1517

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

Linear time solvable optimization problems on graphs of bounded clique width
B. Courcelle, J.A. Makowsky, U. Rotics
Lecture Notes in Computer Science 1517, 1998, pp. 1-16
Minus domination in small-degree graphs
Peter Damaschke
Lecture Notes in Computer Science 1517, 1998, pp. 17-25
The vertex-disjoint triangles problem
Venkatesan Guruswami, C. Pandu Rangan, M.S. Chang, G.J. Chang, C.K. Wong
Lecture Notes in Computer Science 1517, 1998, pp. 26-37
Communication in the two-way listen-in vertex-disjoint paths mode
Hans-Joachim Böckenhauer
Lecture Notes in Computer Science 1517, 1998, pp. 38-49
Broadcasting on anonymous unoriented tori
Stefan Dobrev, Peter Ruz̑ic̑ka
Lecture Notes in Computer Science 1517, 1998, pp. 50-62
Families of graphs having broadcasting and gossiping properties
Guillaume Fertin, André Raspaud
Lecture Notes in Computer Science 1517, 1998, pp. 63-77
Optical all-to-all communication in inflated networks
Olivier Togni
Lecture Notes in Computer Science 1517, 1998, pp. 78-87
A generalization of AT-free graphs and a generic algortihm for solving treewidth, minimum fill-in and vertex ranking
Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller
Lecture Notes in Computer Science 1517, 1998, pp. 88-99
A polynomial-time algorithm for finding total colorings of partial k-trees
Shuji Isobe, Xiao Zhou, Takao Nishizeki
Lecture Notes in Computer Science 1517, 1998, pp. 100-113
Rankings of directed graphs
Jan Kratochvíl, Zsolt Tuza
Lecture Notes in Computer Science 1517, 1998, pp. 114-123
Drawing planar partitions II: HH-drawings
Therese Biedl, Michael Kaufmann, Petra Mutzel
Lecture Notes in Computer Science 1517, 1998, pp. 124-136
Triangles in Euclidean arrangements
Stefan Felsner, Klaus Kriegel
Lecture Notes in Computer Science 1517, 1998, pp. 137-148
Internally typed second-order term graphs
Wolfram Kahl
Lecture Notes in Computer Science 1517, 1998, pp. 149-163
Compact implicit representation of graphs
Maurizio Talamo, Paola Vocca
Lecture Notes in Computer Science 1517, 1998, pp. 164-176
Graphs with bounded induced distance
Serafino Cicerone, Gabriele di Stefano
Lecture Notes in Computer Science 1517, 1998, pp. 177-191
Diameter determination on restricted graph families
Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul
Lecture Notes in Computer Science 1517, 1998, pp. 192-202
Independent tree spanners - Fault-tolerant spanning trees with constant distance guarantees
Dagmar Handke
Lecture Notes in Computer Science 1517, 1998, pp. 203-214
Upgrading bottleneck constrained forests
S.O. Krumke, M.V. Marathe, H. Noltemeier, S.S. Ravi, H.-C. Wirth
Lecture Notes in Computer Science 1517, 1998, pp. 215-226
Routing in recursive circulant graphs: Edge forwarding index and Hamiltonian decomposition
G. Gauyacq, C. Micheneau, A. Raspaud
Lecture Notes in Computer Science 1517, 1998, pp. 227-241
Improved compressions of cube-connected cycles networks
Ralf Klasing
Lecture Notes in Computer Science 1517, 1998, pp. 242-256
Efficient embeddings of grids into grids
Markus Röttger, Ulf-Peter Schroeder
Lecture Notes in Computer Science 1517, 1998, pp. 257-271
Integral uniform flows in symmetric networks
Farhad Shahrokhi, László A. Székely
Lecture Notes in Computer Science 1517, 1998, pp. 272-284
Splitting number is NP-complete
L. Faria, C.M.H. de Figueiredo, C.F.X. Mendonça
Lecture Notes in Computer Science 1517, 1998, pp. 285-297
Tree spanners in planar graphs
Sándor P. Fekete, Jana Kremer
Lecture Notes in Computer Science 1517, 1998, pp. 298-309
A linear-time algorithm to find four independent spanning trees in four-connected planar graphs
Kazuyuki Miura, Daishiro Takahashi, Shin-ichi Nakano, Takao Nishizeki
Lecture Notes in Computer Science 1517, 1998, pp. 310-323

Seiten 1 2 >