Graph-Theoretic Concepts in Computer Science
Editat de Jan Van Leeuwenen Limba Engleză Paperback – 20 mai 1994
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.
Preț: 329.74 lei
Preț vechi: 412.17 lei
-20%
Puncte Express: 495
Carte tipărită la comandă
Livrare economică 08-22 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540578994
ISBN-10: 3540578994
Pagini: 448
Ilustrații: XI, 437 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.67 kg
Ediția:1994
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540578994
Pagini: 448
Ilustrații: XI, 437 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.67 kg
Ediția:1994
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
V-ar putea interesa
-
Alan Turing: His Work and ImpactS. Barry Cooper-21%Preț: 401.29 lei507.25 lei -
Computer Vision: Models, Learning, and InferenceSimon J. D. Prince-20%Preț: 561.50 lei701.88 lei -
Enterprise Content and Search Management for Building Digital PlatformsShailesh Kumar Shivakumar-20%Preț: 493.61 lei617.00 lei -
Spock: Up and RunningRob Fletcher-20%Preț: 340.43 lei425.53 lei -
Tragic DesignJonathan Shariat-20%Preț: 181.81 lei227.26 lei -
Thoughtful Machine Learning with PythonMatthew Kirk-20%Preț: 244.61 lei305.76 lei -
This is Service Design DoingMarc Stickdorn-20%Preț: 246.08 lei307.59 lei -
Karau, H: High Performance SparkHolden Karau-20%Preț: 233.24 lei291.55 lei -
Practical TableauRyan Sleeper-20%Preț: 314.11 lei392.64 lei -
A Course in Mathematical CryptographyGilbert Baumslag-20%Preț: 323.07 lei403.83 lei -
Distributed AlgorithmsJan Van LeeuwenPreț: 384.81 lei -
Distributed AlgorithmsJan Van Leeuwen-20%Preț: 329.51 lei411.90 lei -
Algorithms - ESA '94Jan Van Leeuwen-20%Preț: 334.04 lei417.55 lei -
Computer Science TodayJan Van Leeuwen-20%Preț: 422.89 lei528.62 lei
Public țintă
ResearchCuprins
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.