Graphtheoretic concepts in computer science : proceedings of the international workshop WG 80, Bad Honnef, June 15-18, 1980

সংরক্ষণ করুন:
গ্রন্থ-পঞ্জীর বিবরন
অন্যান্য লেখক: Noltemeier, Hartmut, 1940- (Publishing director)
বিন্যাস: Livre numérique
ভাষা:Anglais
প্রকাশিত: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
মালা:Lecture notes in computer science 100
বিষয়গুলি:
অনলাইন ব্যবহার করুন: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:• Graphtheoretic concepts in computer science, proceedings of the international workshop WG 80, Bad Honnef, June 15-18, 1980, edited by Hartmut Noltemeier, Berlin, Springer-Verlag, 1981, 1 vol. (X-403 p.), Lecture notes in computer science, 0-387-10291-4
• Graphtheoretic Concepts in Computer Science, Texte imprimé, 9783540102915
• Graphtheoretic Concepts in Computer Science, Texte imprimé, 9783662176504
LEADER 03969nam a22003617a 4500
001 945561
008 110927q2000 xxe ||| |||| 00| 0 eng d
009 PPN155232665
020 |a 9783540384359 (PDF) 
041 0 |a eng 
082 |a 004 
082 |a 511.5 
245 0 0 |a Graphtheoretic concepts in computer science :  |b proceedings of the international workshop WG 80, Bad Honnef, June 15-18, 1980   |c edited by Hartmut Noltemeier. 
260 |a Berlin [etc.] :  |b Springer. 
260 |a Cham :  |b Springer Nature,  |c [20..]. 
490 0 |a Lecture notes in computer science  |v 100  |x 1611-3349 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
505 0 |a The post-office problem and related questions -- Series of graphs generated by rational machines -- On linearizing graphs -- Set-theoretic concepts in programming languages and their implementation -- Graph rewriting and automatic, machine-independent program optimization -- Properties of ordered graph grammars -- The power of a one-dimensional vector of processors -- A new data structure for representing sorted lists -- On the use of some almost sure graph properties -- On a generalization of heaps -- Graph grammars and the complexity gap in the isomorphism problem for acyclic digraphs -- Issues in the study of graph embeddings -- Schema hypergraphs:A formalism to investigate logical data base design -- The use of transitively irreducible kernels of full families of functional dependencies in logical data base design -- Graph algorithms for the synthesis and manipulation of data base schemes -- The analysis of search trees: A survey -- A framework for data structures -- Investigating programs in terms of partial graphs -- An observation concerning the complexity of problems with few solutions and its application to cryptography -- Bounding the bandwidth of NP-complete problems -- The complexity of path problems in graphs and path systems of bounded bandwidth -- A comparison between petri-nets and graph grammars -- A graph grammar representation of nonsequential processes -- Reachability homomorphisms on nets -- A birds eye view to path problems -- The chinese postman problem for mixed graphs -- Alternating cycle covers and paths -- Generating all planar 0-,1-,2-,3-connected graphs -- Optimal (s,t)-cuts -- F-factors, perfect matchings and related concepts. 
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 
650 |a Informatique 
650 |a Actes de congrès 
700 1 |a Noltemeier, Hartmut,  |d 1940-  |4 pbd 
776 0 |0 023973870  |t Graphtheoretic concepts in computer science  |o proceedings of the international workshop WG 80, Bad Honnef, June 15-18, 1980  |f edited by Hartmut Noltemeier  |c Berlin  |n Springer-Verlag  |d 1981  |p 1 vol. (X-403 p.)  |s Lecture notes in computer science  |z 0-387-10291-4 
776 0 |t Graphtheoretic Concepts in Computer Science  |b Texte imprimé  |z 9783540102915 
776 0 |t Graphtheoretic Concepts in Computer Science  |b Texte imprimé  |z 9783662176504 
856 4 |q PDF  |u https://doi.org/10.1007/3-540-10291-4  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-B56PV856-P  |z Accès sur la plateforme Istex 
856 4 |5 452349901:747909431  |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-10291-4  |z Accès Université d'Orléans 
856 4 |5 180339901:750922311  |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-10291-4  |z Accès INSA CVL 
997 |0 945561  |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/