Graph-theoretic concepts in computer science : 26th international workshop, WG 2000, Konstanz, Germany, June 15-17, 2000 : proceedings / Ulrik Brandes, Dorothea Wagner (eds.).
Contributor(s): Brandes, Ulrik | Wagner, DorotheaMaterial type: TextSeries: SerienbezeichnungLecture notes in computer science: 1928.Publisher: Berlin ; New York : Springer, 2000Description: 1 online resource (x, 313 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783540400646; 3540400648Other title: WG 2000Subject(s): Algorithms -- Congresses | Computer science -- Congresses | Graph theory -- Data processing -- Congresses | Algorithms | Computer science | Graph theory -- Data processing | Graphentheorie | Informatik | Theoretische InformatikGenre/Form: Electronic books. | Conference papers and proceedings. Additional physical formats: Print version:: Graph-theoretic concepts in computer science.DDC classification: 004.015115 LOC classification: QA166 | .I572 2000Other classification: SS 4800 | MAT 055f Online resources: Click here to access online
|Item type||Current location||Collection||Call number||Status||Date due||Barcode||Item holds|
Print version record.
This book constitutes the thoroughly refereed post-workshop proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2000, held in Konstanz, Germany, in June 2000. The 26 revised full papers presented together with two invited contributions were carefully reviewed and selected from 51 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.
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.