Graph-Theoretic Concepts in Computer Science: 19th International Workshop, WG '93, Utrecht, The Netherlands, June 16 - 18, 1993. Proceedings Jan van L - neues Buch

EAN (ISBN-13): 9783540578994
ISBN (ISBN-10): 3540578994
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 1994
Herausgeber: Springer Berlin Heidelberg Core >1 >T
431 Seiten
Gewicht: 0,672 kg

Buch in der Datenbank seit 2007-05-15T19:52:30+02:00 (Zurich)
Detailseite zuletzt geändert am 2024-02-15T11:10:06+01:00 (Zurich)
ISBN/EAN: 9783540578994

ISBN - alternative Schreibweisen:
3-540-57899-4, 978-3-540-57899-4
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: leeuwen van, jan leeuw, editor
Titel des Buches: workshop 1993, proceedings international workshop, nederlands, 993 1993, graph theoretic concepts computer science, utrecht, lecture notes computer science, international 1993 1998

---

Daten vom Verlag:

Autor/in: Jan van Leeuwen
Titel: Lecture Notes in Computer Science; Graph-Theoretic Concepts in Computer Science - 19th International Workshop, WG '93, Utrecht, The Netherlands, June 16 - 18, 1993. Proceedings
Verlag: Springer; Springer Berlin
437 Seiten
Erscheinungsjahr: 1994-05-20
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XI, 437 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Graph; Graph-Algorithmen; Kombinatorische Algorithmen; Layout; algorithm; algorithms; combinatorial algorithms; distributed algorithms; graph algorithms; graph theory; network theory; algorithm analysis and problem complexity; combinatorics; Theory of Computation; Discrete Mathematics; Computer and Information Systems Applications; Algorithms; Computer Science Logic and Foundations of Programming; Diskrete Mathematik; Angewandte Informatik; Algorithmen und Datenstrukturen; EA

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.