Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=790

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

Near-optimal dominating sets in dense Random graphs in polynomial expected time
Sotiris E. Nikoletseas, Paul G. Spirakis
Lecture Notes in Computer Science 790, 1993, pp. 1-10
Approximating minimum weight perfect matchings for complete graphs satisfying the triangle inequality
N.W. Holloway, S. Ravindran, A.M. Gibbons
Lecture Notes in Computer Science 790, 1993, pp. 11-20
Hierarchically specified unit disk graphs
M.V. Marathe, V. Radhakrishnan, H.B. Hunt III, S.S. Ravi
Lecture Notes in Computer Science 790, 1993, pp. 21-32
Bounded tree-width and LOGCFL
Egon Wanke
Lecture Notes in Computer Science 790, 1993, pp. 33-44
On reduction algorithms for graphs with small treewidth
Hans Bodlaender
Lecture Notes in Computer Science 790, 1993, pp. 45-56
Algorithms and complexity of sandwich problems in graphs
Martin Charles Golumbic, Haim Kaplan, Ron Shamir
Lecture Notes in Computer Science 790, 1993, pp. 57-69
On-line graph algorithms for incremental compilation
Alberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert
Lecture Notes in Computer Science 790, 1993, pp. 70-86
Average case analysis of fully dynamic connectivity for directed graphs
Paola Alimonti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Xavier Messeguer
Lecture Notes in Computer Science 790, 1993, pp. 87-98
Fully dynamic maintenance of vertex cover
Zoran Iković, Errol L. Lloyd
Lecture Notes in Computer Science 790, 1993, pp. 99-111
Dynamic algorithms for graphs with treewidth 2
Hans L. Bodlaender
Lecture Notes in Computer Science 790, 1993, pp. 112-124
Short disjoint cycles in graphs with degree constraints
Andreas Brandstädt, Heinz-Jürgen Voss
Lecture Notes in Computer Science 790, 1993, pp. 125-131
Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs
Koichi Wada, Kimio Kawaguchi
Lecture Notes in Computer Science 790, 1993, pp. 132-143
Towards a solution of the Holyer's problem
Zbigniew Lonc
Lecture Notes in Computer Science 790, 1993, pp. 144-152
Graphs, hypergraphs and hashing
George Havas, Bohdan S. Majewski, Nicholas C. Wormald, Zbigniew J. Czech
Lecture Notes in Computer Science 790, 1993, pp. 153-165
Coloring k-colorable graphs in constant expected parallel time
Ludȇk Kuc̑era
Lecture Notes in Computer Science 790, 1993, pp. 166-176
Deciding 3-colourability in less than O(1.415^n) steps
Ingo Schiermeyer
Lecture Notes in Computer Science 790, 1993, pp. 177-188
A rainbow about T-colorings for complete graphs
Klaus Jansen
Lecture Notes in Computer Science 790, 1993, pp. 189-199
Approximating the chromatic polynomial of a graph
Nai-Wei Lin
Lecture Notes in Computer Science 790, 1993, pp. 200-210
Asteroidal triple-free graphs
Derek G. Corneil, Stephan Olariu, Lorna Stewart
Lecture Notes in Computer Science 790, 1993, pp. 211-224
The parallel complexity of elimination ordering procedures
Elias Dahlhaus
Lecture Notes in Computer Science 790, 1993, pp. 225-236
Dually chordal graphs
Andreas Brandstädt, Feodor F. Dragan, Victor D. Chepoi, Vitaly I. Voloshin
Lecture Notes in Computer Science 790, 1993, pp. 237-251
The size of reduced OBDDs and optimal read-once branching programs for almost all Boolean functions
Ingo Wegener
Lecture Notes in Computer Science 790, 1993, pp. 252-263
Regular marked Petri nets
Jörg Desel
Lecture Notes in Computer Science 790, 1993, pp. 264-275
The asynchronous committee meeting problem
Javier Esparza, Bernhard von Stengel
Lecture Notes in Computer Science 790, 1993, pp. 276-287
Gossiping in vertex-disjoint paths mode in interconnection networks
Juraj Hromkovic̑, Ralf Klasing, Elena A. Stöhr
Lecture Notes in Computer Science 790, 1993, pp. 288-300

Seiten 1 2 >