## Graph-Theoretic Concepts in Computer Science: 19th International Workshop, WG '93, Utrecht, The Netherlands, June 16 - 18, 1993. ProceedingsThis volume contains the proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science, WG '93, held near Utrecht, The Netherlands, in 1993. 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. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Other editions - View all

Graph-Theoretic Concepts in Computer Science: 19th International Workshop ... Jan van Leeuwen No preview available - 2014 |

### Common terms and phrases

adjacent algorithm applied approximation assigned assume bound called chordal graphs Claim clique color communication complete component Computer Computer Science connected consider constant construct contains corresponding cycle data structure decomposition defined definition deletion denote directed dynamic edge efficient element embedding example exists face Figure finite fixed functions give given graph G hash Hence holds independent induced input insertion integer interval known label least Lemma length linear marked matching maximum method neighbors nodes Note obtained operations optimal ordering pair parallel path perfect performed planar polynomial possible present probability problem processors Proof prove random reduced representation represented requires respect routing rule running sandwich satisfying sequence shown solution solved steps structure subgraph Suppose Theorem tree University update values variable vertex vertices weight width

### Popular passages

Page 124 - Miller and J. Reif. Parallel tree contraction and its application. In Proceedings of the 26th Annual Symposium on Foundations of Computer Science, pages