Discrete Structures and Algorithms: Proceedings of the Workshop WG 79, 5. Conference on Graphtheoret. Concepts in Computer Science, June 21-23, 1979, Berlin (West), GermanyUwe Pape |
Contents
Gottfried Tinhofer München | 1 |
A H Maurer Graz | 17 |
Uwe Pape Berlin | 47 |
Copyright | |
12 other sections not shown
Common terms and phrases
adjacency lists algebraic flow algorithm application arc-feasible arcs b₁ B₂ clause components Computer conflict solution consistent contains corresponding cost cycle cover data structure deadlock decomposable searching problems defined deletion directed graph edge set equivalent ERSITY example F-factor FC-Net function G and G G₁ given GRAMAS graph G Graph Grammars graph isomorphism graph isomorphism problem Graphen graphsack problem hand side implemented increment flow indegree ISEMPTY F isomorphism problem isomorphism test KMAX Knoten labelled graphs LIBRARY manipulation matrix matroid maximal matching method minimal minimum spanning trees München n-clique nodes NP-complete operations optimal solution outdegree partition path Petri nets polynomial production programming Proof QUFAM resp SAN DIEGO semantical schedule sequential SETFAM significant elements solving spanning forest spanning trees step storage subgradient subgradient method subgraph subproblems subset Technische Universität Berlin Theorem transformation transition undirected UNIV Universität vector vertex vertices