Graph-theoretic concepts in computer science : 26th International workshop, WG 2000, Konstanz, Germany, June 15-17, 2000 : proceedings
The 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2000) was held at Waldhaus Jakob, in Konstanz, Germany, on 15{ 17 June 2000. It was organized by the Algorithms and Data Structures Group of the Department of Computer and Information Science, University of K- stanz,...
Sparad:
| Institutionell upphovsman: | |
|---|---|
| Övriga upphovsmän: | , |
| Materialtyp: | Livre numérique |
| Språk: | Anglais |
| Publicerad: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serie: | Lecture notes in computer science
1928 |
| Ämnen: | |
| Länkar: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Anmärkning: |
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, 26th International workshop, WG 2000, Konstanz, Germany, June 15-17, 2000, proceedings, Ulrik Brandes, Dorothea Wagner (eds.), 2000, Berlin, Springer, 1 vol. (X-313 p.), Lecture notes in computer science, 3-540-41183-6 • Graph-Theoretic Concepts in Computer Science, Texte imprimé, 9783662201527 |
Innehållsförteckning:
- On the Expected Runtime and the Success Probability of Evolutionary Algorithms (Invited Presentation)
- n Points and One Line: Analysis of Randomized Games (Abstract of Invited Lecture)
- Approximating Call-Scheduling Makespan in All-Optical Networks
- New Spectral Lower Bounds on the Bisection Width of Graphs
- Traversing Directed Eulerian Mazes (Extended Abstract)
- On the Space and Access Complexity of Computation DAGs
- Approximating the Treewidth of AT-Free Graphs
- Split-Perfect Graphs: Characterizations and Algorithmic Use
- Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs
- Networks with Small Stretch Number (Extended Abstract)
- Efficient Dispersion Algorithms for Geometric Intersection Graphs
- Optimizing Cost Flows by Modifying Arc Costs and Capacities
- Update Networks and Their Routing Strategies
- Computing Input Multiplicity in Anonymous Synchronous Networks with Dynamic Faults
- Diameter of the Knödel Graph
- On the Domination Search Number
- Efficient Communication in Unknown Networks
- Graph Coloring on a Coarse Grained Multiprocessor (Extended Abstract)
- The Tree-Width of Clique-Width Bounded Graphs without K n,n
- Tree Spanners for Subgraphs and Related Tree Covering Problems
- Minimal Size of Piggybacked Information for Tracking Causality: A Graph-Based Characterization
- The Expressive Power and Complexity of Dynamic Process Graphs
- Bandwidth of Split and Circular Permutation Graphs
- Recognizing Graphs without Asteroidal Triples (Extended Abstract)
- Budget Constrained Minimum Cost Connected Medians
- Coloring Mixed Hypertrees
- A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs
- Optimal Fault-Tolerant Routings for k-Connected Graphs with Smaller Routing Tables.