Graph-theoretic concepts in computer science : 18th International Workshop, WG '92, Wiesbaden-Naurod, Germany, June 18-20, 1992 : proceedings
The 18th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '92) was held in Wiesbaden-Naurod, Germany, June 18-20, 1992. Itwas organized by the Department of Computer Science, Johann Wolfgang Goethe University, Frankfurt am Main. Contributions with original results inth...
Salvato in:
| Autore principale: | |
|---|---|
| Ente Autore: | |
| Natura: | Livre numérique |
| Lingua: | Anglais |
| Pubblicazione: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serie: | Lecture notes in computer science
657 |
| Soggetti: | |
| Accesso online: | 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, 18th International Workshop, WG '92, Wiesbaden-Naurod, Germany, June 18-20, 1992, proceedings, E.W. Mayr, ed., Berlin, Springer-Verlag, 1993, 1 vol. (349 p.), Lecture notes in computer science, 0-387-56402-0 • Graph-Theoretic Concepts in Computer Science, Texte imprimé, 9783662168974 |
Sommario:
- On improved time bounds for permutation graph problems
- A simple test for interval graphs
- Tolerance graphs and orders
- On scheduling problems restricted to interval orders
- Scheduling with incompatible jobs
- Generalized coloring for tree-like graphs
- Optimal (parallel) algorithms for the all-to-all vertices distance problem for certain graph classes
- Topology of parallel networks and computational complexity (extended abstract)
- Parallel triangulation of nonconvex polytopes
- Kayles on special classes of graphs An application of Sprague-Grundy theory
- A linear time algorithm for isomorphism of graphs of bounded average genus
- Improved algorithms for routing on two-dimensional grids
- Minimum rectilinear steiner trees for intervals on two parallel lines
- A new characterization of tree medians with applications to distributed algorithms
- The 3-edge-components and a structural description of all 3-edge-cuts in a graph
- On assembly of four-connected graphs
- On the homogeneous decomposition of graphs
- Embeddings in recursive combinatorial networks
- On shortcutting digraphs
- An efficient algorithm to recognize prime undirected graphs
- On the complexity of partial order properties
- Probabilistic graph grammars
- Single vs. double pushout derivations of graphs
- Hexagonal grid drawings
- Graph algorithms = iteration + data structures?
- Petri nets, hypergraphs and conflicts (preliminary version)
- Analysis and manipulation of Boolean functions in terms of decision graphs
- The expressiveness of silence: Tight bounds for synchronous communication of information using bits and silence
- The power and the limitations of local computations on graphs.