## Discrete structures and algorithms: proceedings of the workshop WG 79, 5. Conference on Graphtheoret. Concepts in Computer Science, June 21-23, 1979, Berlin (West), Germany |

### What people are saying - Write a review

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

### Contents

Gottfried Tinhofer München | 1 |

A H Maurer Graz | 17 |

Uwe Pape Berlin | 47 |

Copyright | |

5 other sections not shown

### Common terms and phrases

algebraic flow algorithm arc-feasible arcs Berlin binary called capacity cells components Computer conflict solution consistency contains corresponding cycle cover Data Base data structure deadlock decomposable searching problems defined deletion directed graph dynamic edge set equivalent example F-factor FC-Net finite function G and G given GRAMAS Graph Coloring graph G Graph Grammars graph isomorphism graph isomorphism problem Graphen graphsack problem implemented increment flow indegree Informatik isomorphism problem isomorphism test Kanten KMAX knapsack problem Knoten labelled graphs Lemma linear manipulation matrix matroid maximal flow maximal matching method minimal Munchen n-clique node denotations nodes NP-complete operations optimal solution outdegree partial graph partition path Petri nets polynomial production Proof properties query resp semantical schedule A(s sequential significant elements solving spanning forest step storage subgradient subgradient method subgraph subproblems subset Technische Universitat Berlin Theorem transformation undirected Universitat vector Verfahren vertex vertices weighted graphs Zusammenfassung