Graph-theoretic concepts in computer science : 24th international workshop, WG'98, Smolenice Castle, Slovak Republic, June 18-20, 1998 : proceedings
সংরক্ষণ করুন:
| সংস্থা লেখক: | |
|---|---|
| অন্যান্য লেখক: | , |
| বিন্যাস: | Livre numérique |
| ভাষা: | Anglais |
| প্রকাশিত: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| মালা: | Lecture notes in computer science
1517 |
| বিষয়গুলি: | |
| অনলাইন ব্যবহার করুন: | 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, 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 |
সূচিপত্রের সারণি:
- 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.