Graph-theoretic concepts in computer science : 15th international workshop WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989 : proceedings
The aim of this workshop series is to contribute to integration in computer science by applying graph-theoretic concepts. Commonalities between various fields of specialization in computer science may be detected by applying graph-theoretic concepts. The workshops are unusual in that they combine th...
Enregistré dans:
| 企業作者: | |
|---|---|
| 其他作者: | |
| 格式: | Livre numérique |
| 語言: | Anglais |
| 出版: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| 叢編: | Lecture notes in computer science
411 |
| 主題: | |
| 在線閱讀: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| 提示: |
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, 15th international workshop WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989, proceedings, M. Nagl, ed, Berlin, Springer-Verlag, 1990, 1 vol. (VII-372 p.), Lecture notes in computer science, 0-387-52292-1 • Graph-Theoretic Concepts in Computer Science, Texte imprimé, 9783662201312 |
書本目錄:
- Disjoint paths in the hypercube
- Time bounds for broadcasting in bounded degree graphs
- t/s-Diagnosable systems: A characterization and diagnosis algorithm
- Toward a complete representation of graphoids in graphs Abridged Version
- CADULA A graph-based model for monitoring CAD-processes
- On hyperedge replacement and BNLC graph grammars
- Graph rewriting systems with priorities
- Filtering hyperedge-replacement languages through compatible properties
- Describing distributed systems by categorical graph grammars
- A parser for context free plex grammars
- to PROGRESS, an attribute graph grammar based specification language
- On the complexity of optimal drawings of graphs
- Bounds to the page number of partially ordered sets
- Beyond Steiner's problem: A VLSI oriented generalization
- A fast sequential and parallel algorithm for the computation of the k-closure of a graph
- On feedback problems in digraphs
- Improved self-reduction algorithms for graphs with bounded treewidth
- Finding a minimal transitive reduction in a strongly connected digraph within linear time
- Paging binary trees with external balancing
- The complexity of graph problems for succinctly represented graphs
- An O(n log n) algorithm for 1-D tile compaction
- Weighted parallel triangulation of simple polygons
- Implementing data structures on a hypercube multiprocessor, and applications in parallel computational geometry
- k Nearest Neighbor Voronoi diagrams for sets of convex polygons, line segments and points
- Finding squares and rectangles in sets of points
- Combinatorial properties of abstract Voronoi diagrams.