Graph-theoretic concepts in computer science : 17th International Workshop, WG '91, Fischbachau, Germany, June 17 19 1991 : proceedings
This volume contains contributions to the 17th International workshop on Graph-Theoretic Concepts in Computer Science (WG '91) held in Southern Bavaria in June 1991. These annual workshops are designed to bring together researchers using graph-theoretic methods to discuss new developments relat...
Guardat en:
| Autor corporatiu: | |
|---|---|
| Altres autors: | , |
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Col·lecció: | Lecture notes in computer science
570 |
| Matèries: | |
| Accés en línia: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Graph-theoretic concepts in computer science, 17th International Workshop WG '91, Fischbachau, Germany, June 17-19, 1991, proceedings, R. Berghammer, G. Schmidt (eds.), Berlin, Springer-Verlag, 1992, 1 vol. (viii, 252 p.), Lecture notes in computer science, 3-540-55121-2 • Graph-Theoretic Concepts in Computer Science, Texte imprimé, 9783662170922 |
Taula de continguts:
- Approximating treewidth, pathwidth, and minimum elimination tree height
- Monadic second-order evaluations on tree-decomposable graphs
- Optimal embedding of complete binary trees into lines and grids
- Graph rewriting systems and their application to network reliability analysis
- Nondeterministic control structures for graph rewriting systems
- A language for generic graph-transformations
- Attributed elementary programmed graph grammars
- The complexity of approximating the class Steiner tree problem
- On complexity of some chain and antichain partition problems
- Tight bounds for the rectangular art gallery problem
- Voronoi diagrams of moving points in the plane
- Using maximal independent sets to solve problems in parallel
- Fast parallel algorithms for coloring random graphs
- Optimal vertex ordering of a graph and its application to symmetry detection
- Edge separators for graphs of bounded genus with applications
- Line digraph iterations and the spread concept with application to graph theory, fault tolerance, and routing
- A generalized encryption scheme based on random graphs
- Dynamic algorithms for shortest paths in planar graphs
- Complete problems for logspace involving lexicographic first paths in graphs
- A new upper bound on the complexity of the all pairs shortest path problem
- On the crossing number of the hypercube and the cube connected cycles
- Logic arrays for interval indicator functions
- On the broadcast time of the butterfly network
- On disjoint cycles
- Short disjoint cycles in cubic bridgeless graphs.