Graph-Theoretic Concepts in Computer Science 26th International Workshop, WG 2000 Konstanz, Germany, June 15-17, 2000 Proceedings /
Graph-Theoretic Concepts in Computer Science 26th International Workshop, WG 2000 Konstanz, Germany, June 15-17, 2000 Proceedings / [electronic resource] :
edited by Ulrik Brandes, Dorothea Wagner.
- 1st ed. 2000.
- X, 313 p. online resource.
- Lecture Notes in Computer Science, 1928 1611-3349 ; .
- Lecture Notes in Computer Science, 1928 .
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.
The 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2000) was held at Waldhaus Jakob, in Konstanz, Germany, on 15
9783540400646
10.1007/3-540-40064-8 doi
Computer programming.
Computer science.
Data structures (Computer science).
Information theory.
Algorithms.
Computer science--Mathematics.
Discrete mathematics.
Artificial intelligence--Data processing.
Programming Techniques.
Theory of Computation.
Data Structures and Information Theory.
Algorithms.
Discrete Mathematics in Computer Science.
Data Science.
QA76.6-76.66
005.11
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.
The 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2000) was held at Waldhaus Jakob, in Konstanz, Germany, on 15
9783540400646
10.1007/3-540-40064-8 doi
Computer programming.
Computer science.
Data structures (Computer science).
Information theory.
Algorithms.
Computer science--Mathematics.
Discrete mathematics.
Artificial intelligence--Data processing.
Programming Techniques.
Theory of Computation.
Data Structures and Information Theory.
Algorithms.
Discrete Mathematics in Computer Science.
Data Science.
QA76.6-76.66
005.11