Graph-Theoretic Concepts in Computer Science: 17th International Workshop WG '91, Fischbachau, Germany, June 17-19, 1991. Proceedings (Lecture Notes in Computer Science, 570) - gebrauchtes Buch

EAN (ISBN-13): 9783540551218
ISBN (ISBN-10): 3540551212
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 1992
Herausgeber: Springer Berlin

Buch in der Datenbank seit 2014-02-18T13:24:42+01:00 (Zurich)
Detailseite zuletzt geändert am 2023-10-29T11:35:20+01:00 (Zurich)
ISBN/EAN: 9783540551218

ISBN - alternative Schreibweisen:
3-540-55121-2, 978-3-540-55121-8
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: rudolf epp, rudolf schmidt, gunther schmidt, günther, rudolf schmid, gunther schmi, berg rudolf
Titel des Buches: lecture notes computer science, graph theoretic concepts computer science, fischbachau

---

Daten vom Verlag:

Autor/in: Gunther Schmidt; Rudolf Berghammer
Titel: Lecture Notes in Computer Science; Graph-Theoretic Concepts in Computer Science - 17th International Workshop WG '91, Fischbachau, Germany, June 17-19, 1991. Proceedings
Verlag: Springer; Springer Berlin
256 Seiten
Erscheinungsjahr: 1992-01-29
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
VIII, 256 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Mathematik für Informatiker; Verstehen; Graph; VLSI; Vertex; algorithm; algorithms; complexity; computational geometry; computer; computer science; algorithm analysis and problem complexity; combinatorics; data structures; Mathematics of Computing; Algorithms; Discrete Mathematics; Theory of Computation; Data Science; Logic Design; Algorithmen und Datenstrukturen; Diskrete Mathematik; Theoretische Informatik; Datenbanken; Rechnerarchitektur und Logik-Entwurf; EA

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.