Coverart for item
The Resource Graph-theoretic concepts in computer science : 26th international workshop, WG 2000, Konstanz, Germany, June 15-17, 2000 : proceedings, Ulrik Brandes, Dorothea Wagner (eds.)

Graph-theoretic concepts in computer science : 26th international workshop, WG 2000, Konstanz, Germany, June 15-17, 2000 : proceedings, Ulrik Brandes, Dorothea Wagner (eds.)

Label
Graph-theoretic concepts in computer science : 26th international workshop, WG 2000, Konstanz, Germany, June 15-17, 2000 : proceedings
Title
Graph-theoretic concepts in computer science
Title remainder
26th international workshop, WG 2000, Konstanz, Germany, June 15-17, 2000 : proceedings
Statement of responsibility
Ulrik Brandes, Dorothea Wagner (eds.)
Title variation
WG 2000
Creator
Contributor
Subject
Genre
Language
eng
Summary
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
Member of
Cataloging source
SCPER
Dewey number
004.015115
Illustrations
illustrations
Index
no index present
LC call number
QA166
LC item number
.I572 2000
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2000
http://bibfra.me/vocab/lite/meetingName
International Workshop WG
Nature of contents
dictionaries
http://library.link/vocab/relatedWorkOrContributorDate
1957-
http://library.link/vocab/relatedWorkOrContributorName
  • Brandes, Ulrik
  • Wagner, Dorothea
Series statement
Lecture notes in computer science
Series volume
1928
http://library.link/vocab/subjectName
  • Algorithms
  • Computer science
  • Graph theory
  • Algorithms
  • Computer science
  • Graph theory
  • Graphentheorie
  • Informatik
  • Theoretische Informatik
Label
Graph-theoretic concepts in computer science : 26th international workshop, WG 2000, Konstanz, Germany, June 15-17, 2000 : proceedings, Ulrik Brandes, Dorothea Wagner (eds.)
Instantiates
Publication
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
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
Control code
325462106
Dimensions
unknown
Extent
1 online resource (x, 313 pages)
Form of item
online
Isbn
9783540400646
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/3-540-40064-8
Other physical details
illustrations.
Sound
unknown sound
Specific material designation
remote
System control number
(OCoLC)325462106
Label
Graph-theoretic concepts in computer science : 26th international workshop, WG 2000, Konstanz, Germany, June 15-17, 2000 : proceedings, Ulrik Brandes, Dorothea Wagner (eds.)
Publication
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
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
Control code
325462106
Dimensions
unknown
Extent
1 online resource (x, 313 pages)
Form of item
online
Isbn
9783540400646
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/3-540-40064-8
Other physical details
illustrations.
Sound
unknown sound
Specific material designation
remote
System control number
(OCoLC)325462106

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
Processing Feedback ...