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...

Descrizione completa

Salvato in:
Dettagli Bibliografici
Ente Autore: International Workshop on Graph-Theoretic Concepts in Computer Science :Castle Rolduc
Altri autori: Nagl, Manfred, 1944- (Direttore editoriale)
Natura: Livre numérique
Lingua:Anglais
Pubblicazione: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Serie:Lecture notes in computer science 411
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, 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
LEADER 04748nam a22004337a 4500
001 970412
008 110927q2000 xxe ||| |||| 00| 0 eng d
009 PPN155189999
020 |a 9783540469506 (PDF) 
041 0 |a eng 
082 |a 510 
082 |a 511.5 
111 2 |a International Workshop on Graph-Theoretic Concepts in Computer Science  |n (15  |d  :1989  |c  :Castle Rolduc). 
245 1 0 |a Graph-theoretic concepts in computer science :  |b 15th international workshop WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989 : proceedings   |c [edited by] M. Nagl. 
260 |a Berlin [etc.] :  |b Springer. 
260 |a Cham :  |b Springer Nature,  |c [20..]. 
490 0 |a Lecture notes in computer science  |v 411  |x 1611-3349 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
505 0 |a 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. 
506 |a Accès en ligne pour les établissements français bénéficiaires des licences nationales 
506 |a Accès soumis à abonnement pour tout autre établissement 
506 |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 
520 |a 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 theoretical aspects with practice and applications. Applications dealt with in this volume include the use of graph-theoretic concepts in distributed and parallel computation, VLSI, CAD, software engineering, computer graphics, data structures, and computational geometry. 
650 |a Théorie des graphes 
650 |a Algorithmes 
650 |a Mathématiques 
650 |a Analyse combinatoire 
650 |a Structures de données (informatique) 
650 |a Structure logique 
650 |a Actes de congrès 
700 1 |a Nagl, Manfred,  |d 1944-  |4 pbd 
776 0 |0 021419639  |t Graph-theoretic concepts in computer science  |o 15th international workshop WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989  |o proceedings  |f M. Nagl, ed  |c Berlin  |n Springer-Verlag  |d 1990  |p 1 vol. (VII-372 p.)  |s Lecture notes in computer science  |z 0-387-52292-1 
776 0 |t Graph-Theoretic Concepts in Computer Science  |b Texte imprimé  |z 9783662201312 
856 4 |q PDF  |u https://doi.org/10.1007/3-540-52292-1  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-WC6B4TJL-P  |z Accès sur la plateforme Istex 
856 4 |5 452349901:750663413  |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-52292-1  |z Accès Université d'Orléans 
856 4 |5 180339901:754012840  |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-52292-1  |z Accès INSA CVL 
997 |0 970412  |1 Livre numérique  |a Ressource numérique  |b INSA  |b ENSA  |c 0/Bibliothèque numérique/  |c 1/Bibliothèque numérique/Autre ressource numérique/