Cantitate/Preț
Produs
Total produse
Vezi coșul
Graph-Theoretic Concepts in Computer Science: 19th International Workshop, WG '93, Utrecht, The Netherlands, June 16 - 18, 1993. Proceedings de Jan van Leeuwen

Graph-Theoretic Concepts in Computer Science: 19th International Workshop, WG '93, Utrecht, The Netherlands, June 16 - 18, 1993. Proceedings: Lecture Notes in Computer Science, cartea 790

Editat de Jan van Leeuwen
en Limba Engleză Paperback – 20 mai 1994
This volume contains the proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science, WG '93, held near Utrecht, The Netherlands, in 1993.
The papers are grouped into parts on: hard problems on classes of graphs, structural graph theory, dynamic graph algorithms, structure-oriented graph algorithms, graph coloring, AT-free and chordal graphs, circuits and nets, graphs and interconnection networks, routing and shortest paths, and graph embedding and layout.
The 35 revised papers were chosen from 92 submissions after a careful refereeing process.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 32720 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 20 mai 1994 32720 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 25 ian 1989 38319 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 32720 lei

Preț vechi: 40900 lei
-20% Nou

Puncte Express: 491
Preț estimativ în valută:
6262€ • 6606$ • 5219£

Carte tipărită la comandă

Livrare economică 02-16 ianuarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540578994
ISBN-10: 3540578994
Pagini: 448
Ilustrații: XI, 437 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.63 kg
Ediția:1994
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Near-optimal dominating sets in dense random graphs in polynomial expected time.- Approximating minimum weight perfect matchings for complete graphs satisfying the triangle inequality.- Hierarchically specified unit disk graphs.- Bounded tree-width and LOGCFL.- On reduction algorithms for graphs with small treewidth.- Algorithms and complexity of sandwich problems in graphs (extended abstract).- On-line graph algorithms for incremental compilation.- Average case analysis of fully dynamic connectivity for directed graphs.- Fully dynamic maintenance of vertex cover.- Dynamic algorithms for graphs with treewidth 2.- Short disjoint cycles in graphs with degree constraints.- Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs.- Towards a solution of the Holyer's problem.- Graphs, hypergraphs and hashing.- Coloring k-colorable graphs in constant expected parallel time.- Deciding 3-colourability in less than O(1.415n) steps.- A rainbow about T-colorings for complete graphs.- Approximating the chromatic polynomial of a graph.- Asteroidal triple-free graphs.- The parallel complexity of elimination ordering procedures.- Dually chordal graphs.- The size of reduced OBDDs and optimal read-once branching programs for almost all Boolean functions.- Regular marked Petri nets.- The asynchronous committee meeting problem.- Gossiping in vertex-disjoint paths mode in interconnection networks.- The folded Petersen network: A new versatile multiprocessor interconnection topology.- Fast load balancing in Cayley graphs and in circuits.- Concurrent flows and packet routing in Cayley graphs (Preliminary version).- On multi-label linear interval routing schemes.- An ‘All pairs shortest paths’ distributed algorithm using 2n 2 messages.- Linear layouts ofgeneralized hypercubes.- Graph ear decompositions and graph embeddings.- Improved bounds for the crossing numbers on surfaces of genus g.- Two algorithms for finding rectangular duals of planar graphs.- A more compact visibility representation.