Ernst W. Mayr (ed.)

Graph-Theoretic Concepts in Computer Science

18th International Workshop, WG '92, Wiesbaden-Naurod, Germany, June 18-20, 1992. Proceedings
Mitarbeit:Mayr, Ernst W.

• Broschiertes Buch

Produktbeschreibung

The 18th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '92) was held in Wiesbaden-Naurod, Germany, June 18-20, 1992. Itwas organized by the Department of Computer Science, Johann Wolfgang Goethe University, Frankfurt am Main.

Contributions with original results inthe study and application of graph-theoretic concepts in various fields of computer science were solicited, and 72 papers were submitted and reviewed, from which 29 were selected for presentation at the workshop. The workshop was attended by 61 scientists from 16 countries. All 29 papers in the volume have undergone careful revision after the meeting, based on the discussions and comments from the audience and the referees.

The volume is divided into parts on restricted graph classes, scheduling and related problems, parallel anbd distributed algorithms, combinatorial graph problems, graph decomposition, graph grammars and geometry, and modelling by graphs.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Lecture Notes in Computer Science 657
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 978-3-540-56402-7
• 1993.
• Seitenzahl: 364
• Erscheinungstermin: 26. Februar 1993
• Englisch
• Abmessung: 235mm x 155mm x 20mm
• Gewicht: 472g
• ISBN-13: 9783540564027
• ISBN-10: 3540564020
• Artikelnr.: 09255404

Inhaltsangabe

On improved time bounds for permutation graph problems.- A simple test for interval graphs.- Tolerance graphs and orders.- On scheduling problems restricted to interval orders.- Scheduling with incompatible jobs.- Generalized coloring for tree-like graphs.- Optimal (parallel) algorithms for the all-to-all vertices distance problem for certain graph classes.- Topology of parallel networks and computational complexity (extended abstract).- Parallel triangulation of nonconvex polytopes.- Kayles on special classes of graphs - An application of Sprague-Grundy theory.- A linear time algorithm for isomorphism of graphs of bounded average genus.- Improved algorithms for routing on two-dimensional grids.- Minimum rectilinear steiner trees for intervals on two parallel lines.- A new characterization of tree medians with applications to distributed algorithms.- The 3-edge-components and a structural description of all 3-edge-cuts in a graph.- On assembly of four-connected graphs.- On the homogeneous decomposition of graphs.- Embeddings in recursive combinatorial networks.- On shortcutting digraphs.- An efficient algorithm to recognize prime undirected graphs.- On the complexity of partial order properties.- Probabilistic graph grammars.- Single vs. double pushout derivations of graphs.- Hexagonal grid drawings.- Graph algorithms = iteration + data structures?.- Petri nets, hypergraphs and conflicts (preliminary version).- Analysis and manipulation of Boolean functions in terms of decision graphs.- The expressiveness of silence: Tight bounds for synchronous communication of information using bits and silence.- The power and the limitations of local computations on graphs.