Graph-theoretic concepts in computer science : 25th International workshop, WG'99, Ascona, Switzerland, June 17-19, 1999 : proceedings
Na minha lista:
| Autor Corporativo: | |
|---|---|
| Outros Autores: | , , |
| Formato: | Livre numérique |
| Idioma: | Anglais |
| Publicado em: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Colecção: | Lecture notes in computer science
1665 |
| Assuntos: | |
| Acesso em linha: | 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, 25th International workshop, WG'99, Ascona, Switzerland, June 17-19, 1999, proceedings, Peter Widmayer, Gabriele Neyer, Stephan Eidenbenz (eds.), 1999, Berlin, Springer, 1 vol. (XI-414 p.), Lecture notes in computer science, 3-540-66731-8 • Graph-Theoretic Concepts in Computer Science, Texte imprimé, 9783662173169 |
| LEADER | 04803nam a22004217a 4500 | ||
|---|---|---|---|
| 001 | 971134 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN15520209X | ||
| 020 | |a 9783540467847 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 111 | 2 | |a International Workshop on Graph-Theoretic Concepts in Computer Science |n (25 |d :1999 |c :Ascona, Suisse). | |
| 245 | 1 | 0 | |a Graph-theoretic concepts in computer science : |b 25th International workshop, WG'99, Ascona, Switzerland, June 17-19, 1999 : proceedings |c [edited by] Peter Widmayer, Gabriele Neyer, Stephan Eidenbenz. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 1665 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Silver Graphs: Achievements and New Challenges -- Online Algorithms: A Study of Graph-Theoretic Concepts -- Discrete Optimization Methods for Packing Problems in Two and Three Dimensions With Applications in the Textile and Car Manufacturing Industries -- Informatica, Scuola, Communità: Uno Sguardo dall Occhio del Ciclone -- Proximity-Preserving Labeling Schemes and Their Applications -- Euler Is Standing in Line -- Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2 -- Complexity Classification of Some Edge Modification Problems -- On Minimum Diameter Spanning Trees under Reload Costs -- Induced Matchings in Regular Graphs and Trees -- Mod-2 Independence and Domination in Graphs -- NLC2-Decomposition in Polynomial Time -- On the Nature of Structure and Its Identification -- On the Clique Width of Perfect Graph Classes -- An Improved Algorithm for Finding Tree Decompositions of Small Width -- Efficient Analy sis of Graphs with Small Minimal Separators -- Generating All the Minimal Separators of a Graph -- Two Broadcasting Problems in FaultyHypercubes -- Routing Permutations in the Hypercube -- An Optimal Fault-Tolerant Routing for Triconnected Planar Graphs -- Optimal Irreversible Dy namos in Chordal Rings -- Recognizing Bipartite Incident-Graphs of Circulant Digraphs -- Optimal Cuts for Powers of the Petersen Graph -- Dihamiltonian Decomposition of Regular Graphs with Degree Three -- Box-Rectangular Drawings of Plane Graphs -- A Multi-Scale Algorithm for Drawing Graphs Nicely -- All Separating Triangles in a Plane Graph Can Be Optimally Broken in Poly nomial Time -- Linear Orderings of Random Geometric Graphs -- Finding Smallest Supertrees Under Minor Containment -- Vertex Cover: Further Observations and Further Improvements -- On the Hardness ofRecognizing Bundles in Time Table Graphs -- Optimal Solutions for Frequency Assignment Problems via Tree Decomposition -- Fixed-Parameter Complexity of ?-Labelings -- Linear Time Algorithms for Hamiltonian Problems on (Claw,Net) Free Graphs -- On Claw-Free Asteroidal Triple-Free Graphs -- Vertex Partitioning of Crown-Free Interval Graphs -- Triangulated Neighbourhoods in C 4-Free Berge 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 | ||
| 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 Widmayer, Peter, |d 1953- |4 pbd | |
| 700 | 1 | |a Neyer, Gabriele. |4 pbd | |
| 700 | 1 | |a Eidenbenz, Stephan. |4 pbd | |
| 776 | 0 | |0 049040022 |t Graph-theoretic concepts in computer science |o 25th International workshop, WG'99, Ascona, Switzerland, June 17-19, 1999 |o proceedings |f Peter Widmayer, Gabriele Neyer, Stephan Eidenbenz (eds.) |d 1999 |c Berlin |n Springer |p 1 vol. (XI-414 p.) |s Lecture notes in computer science |z 3-540-66731-8 | |
| 776 | 0 | |t Graph-Theoretic Concepts in Computer Science |b Texte imprimé |z 9783662173169 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-46784-X |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-670MVZ1S-K |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:75060266X |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-46784-X |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:753962977 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-46784-X |z Accès INSA CVL | |
| 997 | |0 971134 |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/ | ||