Cantitate/Preț
Produs
Total produse
Vezi coșul
Graph-Theoretic Concepts in Computer Science de Gunther Schmidt

Graph-Theoretic Concepts in Computer Science

Editat de Gunther Schmidt, Rudolf Berghammer
en Limba Engleză Paperback – 29 ian 1992
This volume contains contributions to the 17th Internationalworkshop on Graph-Theoretic Concepts in Computer Science(WG '91) held in Southern Bavaria in June 1991. These annualworkshops are designed to bring together researchers usinggraph-theoretic methods to discuss new developments relatingto or emerging from a diversity of application fields.The topics covered in this volume include: tree-relatedproblems, graph grammarsand rewriting, complexity,computational geometry, parallel algorithms, vertexorderings, path-oriented algorithms, applications to VLSI,and disjoint cycle problems.
Citește tot Restrânge

Preț: 32050 lei

Preț vechi: 40063 lei
-20%

Puncte Express: 481

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 40000 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783540551218
ISBN-10: 3540551212
Pagini: 268
Ilustrații: VIII, 256 p.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.41 kg
Ediția:1992
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Approximating treewidth, pathwidth, and minimum elimination tree height.- Monadic second-order evaluations on tree-decomposable graphs.- Optimal embedding of complete binary trees into lines and grids.- Graph rewriting systems and their application to network reliability analysis.- Nondeterministic control structures for graph rewriting systems.- A language for generic graph-transformations.- Attributed elementary programmed graph grammars.- The complexity of approximating the class Steiner tree problem.- On complexity of some chain and antichain partition problems.- Tight bounds for the rectangular art gallery problem.- Voronoi diagrams of moving points in the plane.- Using maximal independent sets to solve problems in parallel.- Fast parallel algorithms for coloring random graphs.- Optimal vertex ordering of a graph and its application to symmetry detection.- Edge separators for graphs of bounded genus with applications.- Line digraph iterations and the spread concept—with application to graph theory, fault tolerance, and routing.- A generalized encryption scheme based on random graphs.- Dynamic algorithms for shortest paths in planar graphs.- Complete problems for logspace involving lexicographic first paths in graphs.- A new upper bound on the complexity of the all pairs shortest path problem.- On the crossing number of the hypercube and the cube connected cycles.- Logic arrays for interval indicator functions.- On the broadcast time of the butterfly network.- On disjoint cycles.- Short disjoint cycles in cubic bridgeless graphs.