Graph-theoretic concepts in computer science : 22nd International Workshop, WG '96, Cadenabbia, Italy, June 12 14, 1996 : proceedings

This book constitutes the carefully refereed post-proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science, WG '96, held in Cadenabbia, Italy, in June 1996. The 30 revised full papers presented in the volume were selected from a total of 65 submissions. Thi...

Fuld beskrivelse

Enregistré dans:
Bibliografiske detaljer
Institution som forfatter: International Workshop on Graph-Theoretic Concepts in Computer Science :Cadenabbia, Italie
Andre forfattere: d'Amore, Fabrizio (Directeur de la publication), Franciosa, Paolo G. (Directeur de la publication), Marchetti-Spaccamela, Alberto (Directeur de la publication)
Format: Livre numérique
Sprog:Anglais
Udgivet: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Serier:Lecture notes in computer science 1197
Fag:
Online adgang:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Kommentar: 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, 22nd International Workshop WG '96, Cadenabbia, Italy, June 12-14, 1996, proceedings, Fabrizio d'Amore, Paolo G. Franciosa, Alberto Marchetti-Spaccamela (eds.), 1997, Berlin, Springer, 1 vol. (XI-410 p.), Lecture notes in computer science, 3-540-62559-3
• Graph-Theoretic Concepts in Computer Science, Texte imprimé, 9783662177990
LEADER 04919nam a22004337a 4500
001 945605
008 110927q2000 xxe ||| |||| 00| 0 eng d
009 PPN155234110
020 |a 9783540680727 (PDF) 
041 0 |a eng 
082 |a 004 
111 2 |a International Workshop on Graph-Theoretic Concepts in Computer Science  |n (22  |d  :1996  |c  :Cadenabbia, Italie). 
245 1 0 |a Graph-theoretic concepts in computer science :  |b 22nd International Workshop, WG '96, Cadenabbia, Italy, June 12 14, 1996 : proceedings   |c [edited by] Fabrizio d'Amore, Paolo G. Franciosa, Alberto Marchetti-Spaccamela. 
260 |a Berlin [etc.] :  |b Springer. 
260 |a Cham :  |b Springer Nature,  |c [20..]. 
490 0 |a Lecture notes in computer science  |v 1197  |x 1611-3349 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
505 0 |a Hypergraphs and decision trees -- Improved approximations of independent dominating set in bounded degree graphs -- A new characterization of P 4-connected graphs -- Node rewriting in hypergraphs -- On ?-partitioning the n-cube -- Embedding complete binary trees in product graphs -- Clique and anticlique partitions of graphs -- Optimal parallel routing in star graphs -- Counting edges in a dag -- Closure properties of context-free Hyperedge Replacement Systems -- Upward drawings of search trees -- More general parallel tree contraction: Register allocation and broadcasting in a tree -- System diagnosis with smallest risk of error -- Efficient algorithms for shortest path queries in planar digraphs -- LexBFS-orderings and powers of graphs -- Efficient Union-Find for planar graphs and other sparse graph classes -- Switchbox routing in VLSI design: Closing the complexity gap -- Detecting diamond necklaces in labeled dags -- Algebraic graph derivations for graphical calculi -- Definability equals recognizability of partial 3-trees -- One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs -- Approximate maxima finding of continuous functions under restricted budget (Extended abstract) -- The Optimal Cost Chromatic Partition problem for trees and interval graphs -- Modifying networks to obtain low cost trees -- On the hardness of allocating frequencies for hybrid networks -- Homogeneous sets and domination problems -- Independent spanning trees of product graphs -- Designing distrance-preserving fault-tolerant topologies -- Shortest path algorithms for nearly acyclic directed graphs -- Computing disjoint paths with length constraints -- Generalized edge-rankings of trees. 
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 book constitutes the carefully refereed post-proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science, WG '96, held in Cadenabbia, Italy, in June 1996. The 30 revised full papers presented in the volume were selected from a total of 65 submissions. This collection documents the state of the art in the area. Among the topics addressed are graph algorithms, graph rewriting, hypergraphs, graph drawing, networking, approximation and optimization, trees, graph computation, and others. 
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 Actes de congrès 
700 1 |a d'Amore, Fabrizio.  |4 pbd 
700 1 |a Franciosa, Paolo G.  |4 pbd 
700 1 |a Marchetti-Spaccamela, Alberto.  |4 pbd 
776 0 |0 029372755  |t Graph-theoretic concepts in computer science  |o 22nd International Workshop WG '96, Cadenabbia, Italy, June 12-14, 1996  |o proceedings  |f Fabrizio d'Amore, Paolo G. Franciosa, Alberto Marchetti-Spaccamela (eds.)  |d 1997  |c Berlin  |n Springer  |p 1 vol. (XI-410 p.)  |s Lecture notes in computer science  |z 3-540-62559-3 
776 0 |t Graph-Theoretic Concepts in Computer Science  |b Texte imprimé  |z 9783662177990 
856 4 |q PDF  |u https://doi.org/10.1007/3-540-62559-3  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-N52M5DGR-R  |z Accès sur la plateforme Istex 
856 4 |5 452349901:747909067  |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-62559-3  |z Accès Université d'Orléans 
856 4 |5 180339901:750921986  |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-62559-3  |z Accès INSA CVL 
997 |0 945605  |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/