Graph-theoretic concepts in computer science : 16th international workshop WG'90, Berlin, Germany, June 20-22, 1990 : proceedings
This volume gives the proceedings of WG '90, the 16th in a series of workshops. The aim of the workshop series is to contribute to integration in computer science by applying graph-theoretic concepts. The workshops are unusual in that they combine theoretical aspects with practice and applicati...
Gardado en:
| Autor Corporativo: | |
|---|---|
| Outros autores: | |
| Formato: | Livre numérique |
| Idioma: | Anglais |
| Publicado: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Series: | Lecture notes in computer science
484 |
| Sujets: | |
| Acceso en liña: | 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, 16th international workshop WG'90, Berlin, Germany, June 20-22, 1990, proceedings, R.H. Möhring, ed, Berlin, Springer-Verlag, 1991, 1 vol. (IX-358 p.), Lecture notes in computer science, 0-387-53832-1 • Graph-Theoretic Concepts in Computer Science, Texte imprimé, 9783662206829 |
Table des matières:
- Optimal parallel algorithms for sparse graphs
- Finding minimally weighted subgraphs
- On the complexity of some coloring games
- A generalized best-first search method in graphs
- Avoiding matrix multiplication
- Induced subraph isomorphism for cographs is NP-complete
- On feedback problems in planar digraphs
- Recognizing binary hamming graphs in O(n 2 log n) time
- Vertex-disjoint trees and boundary single-layer routing
- Bounds on the quality of approximate solutions to the group Steiner problem
- Two polynomial problems in PLA folding
- The VLSI layout problem in various embedding models
- Approximating the minimum net expansion: Near optimal solutions to circuit partitioning problems
- Deterministic message routing in faulty hypercubes
- On complexity of a message-routing strategy for multicomputer systems
- Embeddings of treelike graphs into 2-dimensional meshes
- Diagnosis of t/s-diagnosable systems
- Deciding 1-solvability of distributed task is NP-hard
- Remarks on some concurrency measures
- On the rectilinear art gallery problem algorithmic aspects
- Separation problems and circular arc systems
- Genus of orders and lattices
- Comparing the expressibility of two languages formed using NP-complete graph operators
- Decomposition of linear recursive logic programs
- On the transition graphs of automata and grammars
- Algebraic approach to graph transformation based on single pushout derivations.