Graph-theoretic concepts in computer science : 24th international workshop, WG'98, Smolenice Castle, Slovak Republic, June 18-20, 1998 : proceedings
Gorde:
| Erakunde egilea: | |
|---|---|
| Beste egile batzuk: | , |
| Formatua: | Livre numérique |
| Hizkuntza: | Anglais |
| Argitaratua: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Saila: | Lecture notes in computer science
1517 |
| Gaiak: | |
| Sarrera elektronikoa: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Oharra: |
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, 24th international workshop, WG'98, Smolenice Castle, Slovak Republic, June 18-20, 1998, proceedings, Juraj Hromkovič, Ondrej Sýkova (eds.), 1998, Berlin, Springer, 1 vol. (X-383 p.), Lecture notes in computer science, 3-540-65195-0 • Graph-Theoretic Concepts in Computer Science, Texte imprimé, 9783662176962 |
| LEADER | 04469nam a22004577a 4500 | ||
|---|---|---|---|
| 001 | 970781 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155196359 | ||
| 020 | |a 9783540494942 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004.015115 | ||
| 082 | |a 004 | ||
| 111 | 2 | |a International Workshop on Graph-Theoretic Concepts in Computer Science |n (24 |d :1998 |c :Smolenice Castle, Slovaquie). | |
| 245 | 1 | 0 | |a Graph-theoretic concepts in computer science : |b 24th international workshop, WG'98, Smolenice Castle, Slovak Republic, June 18-20, 1998 : proceedings |c [edited by] Juraj Hromkovič, Ondrej Sýkora. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 1517 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width -- Minus Domination in Small-Degree Graphs -- The Vertex-Disjoint Triangles Problem -- Communication in the Two-Way Listen-in Vertex-Disjoint Paths Mode -- Broadcasting on Anonymous Unoriented Tori -- Families of Graphs Having Broadcasting and Gossiping Properties -- Optical All-to-All Communication in Inflated Networks -- A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking -- A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees -- Rankings of Directed Graphs -- Drawing Planar Partitions II: HH-Drawings -- Triangles in Euclidean Arrangements -- Internally Typed Second-Order Term Graphs -- Compact Implicit Representation of Graphs -- Graphs with Bounded Induced Distance -- Diameter Determination on Restricted Graph Families -- Independent Tree Spanners -- Upgrading Bottleneck Constrained Forests -- Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian Decomposition -- Improved Compressions of Cube-Connected Cycles Networks -- Efficient Embeddings of Grids into Grids -- Integral Uniform Flows in Symmetric Networks -- Splitting Number is NP-Complete -- Tree Spanners in Planar Graphs -- A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs -- Linear Algorithms for a k-partition Problem of Planar Graphs without Specifying Bases -- Domination and Steiner Tree Problems on Graphs with Few P 4s -- Minimum Fill-In and Treewidth for Graphs Modularly Decomposable into Chordal Graphs -- Interval Completion with the Smallest Max-Degree -- An Estimate of the Tree-Width of a Planar Graph Which Has Not a Given Planar Grid as a Minor. | |
| 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 Information, Théorie de l' | ||
| 650 | |a Algorithmes | ||
| 650 | |a Complexité de calcul (informatique) | ||
| 650 | |a Analyse combinatoire | ||
| 650 | |a Structures de données (informatique) | ||
| 650 | |a Ordinateurs | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Hromkovic, Juraj, |d 1958- |4 pbd | |
| 700 | 1 | |a Sýkora, Ondrej. |4 pbd | |
| 776 | 0 | |0 045456925 |t Graph-theoretic concepts in computer science |o 24th international workshop, WG'98, Smolenice Castle, Slovak Republic, June 18-20, 1998 |o proceedings |f Juraj Hromkovič, Ondrej Sýkova (eds.) |d 1998 |c Berlin |n Springer |p 1 vol. (X-383 p.) |s Lecture notes in computer science |z 3-540-65195-0 | |
| 776 | 0 | |t Graph-Theoretic Concepts in Computer Science |b Texte imprimé |z 9783662176962 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/b71621 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-KTP95Z1R-X |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750659645 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/b71621 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:754009270 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/b71621 |z Accès INSA CVL | |
| 997 | |0 970781 |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/ | ||