Graph-theoretic concepts in computer science : 27th international workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001 : proceedings
This book constitutes the thoroughly refereed post-workshop proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2001, held in Boltenhagen, Germany, in June 2001. The 27 revised full papers presented together with two invited contributions were carefully...
Сохранить в:
| Соавтор: | |
|---|---|
| Другие авторы: | , |
| Формат: | Livre numérique |
| Язык: | Anglais |
| Опубликовано: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Серии: | Lecture notes in computer science
2204 |
| Предметы: | |
| 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 |
| Примечание: |
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, 27th international workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, proceedings, Andreas Brandstädt, Van Bang Le (eds.), Berlin, Springer, 2001, 1 vol. (X-327 p.), Lecture notes in computer science, 3-540-42707-4 • Graph-Theoretic Concepts in Computer Science, Texte imprimé, 9783662184493 |
| LEADER | 04668nam a22004337a 4500 | ||
|---|---|---|---|
| 001 | 970196 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155186248 | ||
| 020 | |a 9783540454779 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 082 | |a 001.64 | ||
| 111 | 2 | |a International Workshop on Graph-Theoretic Concepts in Computer Science |n (27 |d :2001 |c :Boltenhagen). | |
| 245 | 1 | 0 | |a Graph-theoretic concepts in computer science : |b 27th international workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001 : proceedings |c [edited by] Andreas Brandstädt, Van Bang Le. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 2204 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Median Hulls as Steiner Hulls in Rectilinear and Molecular Sequence Spaces -- Data Management in Networks -- Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs -- Approximate Constrained Bipartite Edge Coloring -- Maximum Clique Transversals -- On the Tree-Degree of Graphs -- On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms -- (k+) -Disatance- Herediatry Graphs -- On the Relationship between Clique-Width and Treewidth -- Planarity of the 2-Level Cactus Model -- Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach -- How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time -- (g, f)-Factorizations Orthogonal to k Subgraphs -- On Star Coloring of Graphs -- Graph Subcolorings: Complexity and Algorithms -- Approximation of Pathwidth of Outerplanar Graphs -- On the Monotonicity of Games Generated by Symmetric Submodular Functions -- Multiple Hotlink Assignment -- Small k-Dominating Sets in Planar Graphs with Applications -- Lower Bounds for Algorithms for the Steiner Tree Problem -- log n-Approximative NLCk-Decomposition in O(n 2k+1) Time -- On Subfamilies of AT-Free Graphs -- Complexity of Coloring Graphs without Forbidden Induced Subgraphs -- On Stable Cutsets in Line Graphs -- On Strong Menger-Connectivity of Star Graphs -- The Complexity of the Matching-Cut Problem -- De Bruijn Graphs and DNA Graphs -- A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness -- Critical and Anticritical Edges in Perfect 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 book constitutes the thoroughly refereed post-workshop proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2001, held in Boltenhagen, Germany, in June 2001. The 27 revised full papers presented together with two invited contributions were carefully reviewed and selected from numerous submissions. The papers provide a wealth of new results for various classes of graphs, graph computations, graph algorithms and graph-theoretical applications in various fields. | ||
| 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 Brandstädt, Andreas, |d 1949-...., |c mathématicien. |4 pbd | |
| 700 | 1 | |a Le, Van Bang, |d 1959- |4 pbd | |
| 776 | 0 | |0 058907416 |t Graph-theoretic concepts in computer science |o 27th international workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001 |o proceedings |f Andreas Brandstädt, Van Bang Le (eds.) |c Berlin |n Springer |d 2001 |p 1 vol. (X-327 p.) |s Lecture notes in computer science |z 3-540-42707-4 | |
| 776 | 0 | |t Graph-Theoretic Concepts in Computer Science |b Texte imprimé |z 9783662184493 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-45477-2 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-LW505X8N-V |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750665866 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-45477-2 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:754015025 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-45477-2 |z Accès INSA CVL | |
| 997 | |0 970196 |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/ | ||