Graph-theoretic concepts in computer science : 17th International Workshop, WG '91, Fischbachau, Germany, June 17 19 1991 : proceedings

This volume contains contributions to the 17th International workshop on Graph-Theoretic Concepts in Computer Science (WG '91) held in Southern Bavaria in June 1991. These annual workshops are designed to bring together researchers using graph-theoretic methods to discuss new developments relat...

Descrizione completa

Salvato in:
Dettagli Bibliografici
Ente Autore: International Workshop on Graph-Theoretic Concepts in Computer Science :Fischbachau
Altri autori: Schmidt, Gunther, 1939- (Direttore editoriale), Berghammer, Rudolf, 1952- (Direttore editoriale)
Natura: Livre numérique
Lingua:Anglais
Pubblicazione: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Serie:Lecture notes in computer science 570
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, 17th International Workshop WG '91, Fischbachau, Germany, June 17-19, 1991, proceedings, R. Berghammer, G. Schmidt (eds.), Berlin, Springer-Verlag, 1992, 1 vol. (viii, 252 p.), Lecture notes in computer science, 3-540-55121-2
• Graph-Theoretic Concepts in Computer Science, Texte imprimé, 9783662170922
LEADER 04792nam a22004457a 4500
001 943830
008 110927q2000 xxe ||| |||| 00| 0 eng d
009 PPN155165232
020 |a 9783540467359 (PDF) 
041 0 |a eng 
082 |a 004 
082 |a 004.015115 
111 2 |a International Workshop on Graph-Theoretic Concepts in Computer Science  |n (17  |d  :1991  |c  :Fischbachau). 
245 1 0 |a Graph-theoretic concepts in computer science :  |b 17th International Workshop, WG '91, Fischbachau, Germany, June 17 19 1991 : proceedings   |c [edited by] G. Schmidt, R. Berghammer. 
260 |a Berlin [etc.] :  |b Springer. 
260 |a Cham :  |b Springer Nature,  |c [20..]. 
490 0 |a Lecture notes in computer science  |v 570  |x 1611-3349 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
505 0 |a Approximating treewidth, pathwidth, and minimum elimination tree height -- Monadic second-order evaluations on tree-decomposable graphs -- Optimal embedding of complete binary trees into lines and grids -- Graph rewriting systems and their application to network reliability analysis -- Nondeterministic control structures for graph rewriting systems -- A language for generic graph-transformations -- Attributed elementary programmed graph grammars -- The complexity of approximating the class Steiner tree problem -- On complexity of some chain and antichain partition problems -- Tight bounds for the rectangular art gallery problem -- Voronoi diagrams of moving points in the plane -- Using maximal independent sets to solve problems in parallel -- Fast parallel algorithms for coloring random graphs -- Optimal vertex ordering of a graph and its application to symmetry detection -- Edge separators for graphs of bounded genus with applications -- Line digraph iterations and the spread concept with application to graph theory, fault tolerance, and routing -- A generalized encryption scheme based on random graphs -- Dynamic algorithms for shortest paths in planar graphs -- Complete problems for logspace involving lexicographic first paths in graphs -- A new upper bound on the complexity of the all pairs shortest path problem -- On the crossing number of the hypercube and the cube connected cycles -- Logic arrays for interval indicator functions -- On the broadcast time of the butterfly network -- On disjoint cycles -- Short disjoint cycles in cubic bridgeless graphs. 
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 This volume contains contributions to the 17th International workshop on Graph-Theoretic Concepts in Computer Science (WG '91) held in Southern Bavaria in June 1991. These annual workshops are designed to bring together researchers using graph-theoretic methods to discuss new developments relating to or emerging from a diversity of application fields. The topics covered in this volume include: tree-related problems, graph grammarsand rewriting, complexity, computational geometry, parallel algorithms, vertex orderings, path-oriented algorithms, applications to VLSI, and disjoint cycle problems. 
650 |a Informatique 
650 |a Théorie des graphes 
650 |a Algorithmes 
650 |a Analyse combinatoire 
650 |a Structures de données (informatique) 
650 |a Structure logique 
650 |a Actes de congrès 
700 1 |a Schmidt, Gunther,  |d 1939-  |4 pbd 
700 1 |a Berghammer, Rudolf,  |d 1952-  |4 pbd 
776 0 |0 022401776  |t Graph-theoretic concepts in computer science  |o 17th International Workshop WG '91, Fischbachau, Germany, June 17-19, 1991, proceedings  |f R. Berghammer, G. Schmidt (eds.)  |c Berlin  |n Springer-Verlag  |d 1992  |p 1 vol. (viii, 252 p.)  |s Lecture notes in computer science  |z 3-540-55121-2 
776 0 |t Graph-Theoretic Concepts in Computer Science  |b Texte imprimé  |z 9783662170922 
856 4 |q PDF  |u https://doi.org/10.1007/3-540-55121-2  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-HDW91CF6-0  |z Accès sur la plateforme Istex 
856 4 |5 452349901:747925283  |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-55121-2  |z Accès Université d'Orléans 
856 4 |5 180339901:750937408  |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-55121-2  |z Accès INSA CVL 
997 |0 943830  |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/