Graph-theoretic concepts in computer science : [12th] International workshop WG'86, Bernried, Federal Republic of Germany, June 17-19, 1986 : proceedings

Graph-theoretic concepts are developed by computer scientists in order to model algorithms, nets, rewriting systems, distributed systems, parallelism, geometric and layout concepts. Their complexity is studied under various randomness assumptions. This volume contains contributions to the twelfth of...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Körperschaft: International Workshop on Graph-Theoretic Concepts in Computer Science :Bernried, Allemagne
Weitere Verfasser: Schmidt, Gunther, 1939- (Verlagsleitung), Tinhofer, Gottfried (Verlagsleitung)
Format: Livre numérique
Sprache:Anglais
Veröffentlicht: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Schriftenreihe:Lecture notes in computer science 246
Schlagworte:
Online Zugang:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Anmerkung: 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, International workshop WG'86, Bernried, Federal Republic of Germany, June 17-19, 1986 Proceedings, ed. by Gottfried Tinhofer and Gunther Schmidt, Berlin, Springer, 1987, 1 vol. (VII-305 p.), Lecture notes in computer science, 3-540-17218-1
• Graph-Theoretic Concepts in Computer Science, Texte imprimé, 9783662201831
LEADER 04687nam a22004097a 4500
001 969294
008 110927q2000 xxe ||| |||| 00| 0 eng d
009 PPN155171151
020 |a 9783540474159 (PDF) 
041 0 |a eng 
082 |a 510 
111 2 |a International Workshop on Graph-Theoretic Concepts in Computer Science  |n (12  |d  :1986  |c  :Bernried, Allemagne). 
245 1 0 |a Graph-theoretic concepts in computer science :  |b [12th] International workshop WG'86, Bernried, Federal Republic of Germany, June 17-19, 1986 : proceedings   |c [edited by] Gottfried Tinhofer, Gunther Schmidt. 
260 |a Berlin [etc.] :  |b Springer. 
260 |a Cham :  |b Springer Nature,  |c [20..]. 
490 0 |a Lecture notes in computer science  |v 246  |x 1611-3349 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
505 0 |a A simple linear-time algorithm to recognize interval graphs -- On approximation algorithms for Steiner's problem in graphs -- Specification of error distances for graphs by precedence graph grammars and fast recognition of similarity -- ADA concurrency specified by graph grammars -- Cabri, an interactive system for graph manipulation -- An interactive graphical manipulation system for higher objects based on relational algebra -- Behaviour preserving refinements of Petri nets -- The bandwidth of planar distributive lattices -- The node visit cost of brother trees -- Searching connected components in very large grid graphs -- A simple implementation of Warshall's algorithm on a vlsi chip -- On some generalizations of outerplanar graphs: Results and open problems -- Recognizing outerplanar graphs in linear time -- Graphs and graph polynomials of interest in chemistry -- Applications of parallel scheduling to perfect graphs -- A graph-theoretic approach for designing fair distributed resource schedulingalgorithms -- Improved diameter bounds for altered graphs -- Separability of sets of polygons -- Centipede graphs and visibility on a cylinder -- The diameter of connected components of random graphs -- An algorithm for testing planarity of hierarchical graphs -- EDM A data model for electronic CAD/CAM-applications. 
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 Graph-theoretic concepts are developed by computer scientists in order to model algorithms, nets, rewriting systems, distributed systems, parallelism, geometric and layout concepts. Their complexity is studied under various randomness assumptions. This volume contains contributions to the twelfth of a series of annual workshops designed to bring together researchers using graph-theoretic methods. Its purpose is to broadcast emerging new developments from and to a diversity of application fields. The topics covered include: Graph Grammars, Graph Manipulation, Nets, Complexity Issues, Algorithmic and Network Considerations, Outerplanar Graphs, Graph Isomorphism, Parallelism and Distributed Systems, Graphs and Geometry, Randomness Considerations, Applications in Chemistry, Specific Algorithms. N. 
650 |a Théorie des graphes 
650 |a Réseaux d'ordinateurs 
650 |a Mathématiques 
650 |a Analyse combinatoire 
650 |a Actes de congrès 
700 1 |a Schmidt, Gunther,  |d 1939-  |4 pbd 
700 1 |a Tinhofer, Gottfried.  |4 pbd 
776 0 |0 020197713  |t Graph-theoretic concepts in computer science  |o International workshop WG'86, Bernried, Federal Republic of Germany, June 17-19, 1986 Proceedings  |f ed. by Gottfried Tinhofer and Gunther Schmidt  |c Berlin  |n Springer  |d 1987  |p 1 vol. (VII-305 p.)  |s Lecture notes in computer science  |z 3-540-17218-1 
776 0 |t Graph-Theoretic Concepts in Computer Science  |b Texte imprimé  |z 9783662201831 
856 4 |q PDF  |u https://doi.org/10.1007/3-540-17218-1  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-SVRD0P1D-J  |z Accès sur la plateforme Istex 
856 4 |5 452349901:750675551  |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-17218-1  |z Accès Université d'Orléans 
856 4 |5 180339901:754023974  |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-17218-1  |z Accès INSA CVL 
997 |0 969294  |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/