Graph-Theoretic Concepts in Computer Science (Record no. 187804)
[ view plain ]
000 -LEADER | |
---|---|
fixed length control field | 05788nam a22006615i 4500 |
001 - CONTROL NUMBER | |
control field | 978-3-540-40064-6 |
003 - CONTROL NUMBER IDENTIFIER | |
control field | DE-He213 |
005 - DATE AND TIME OF LATEST TRANSACTION | |
control field | 20240423132436.0 |
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION | |
fixed length control field | cr nn 008mamaa |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
fixed length control field | 121227s2000 gw | s |||| 0|eng d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
International Standard Book Number | 9783540400646 |
-- | 978-3-540-40064-6 |
024 7# - OTHER STANDARD IDENTIFIER | |
Standard number or code | 10.1007/3-540-40064-8 |
Source of number or code | doi |
050 #4 - LIBRARY OF CONGRESS CALL NUMBER | |
Classification number | QA76.6-76.66 |
072 #7 - SUBJECT CATEGORY CODE | |
Subject category code | UM |
Source | bicssc |
072 #7 - SUBJECT CATEGORY CODE | |
Subject category code | COM051000 |
Source | bisacsh |
072 #7 - SUBJECT CATEGORY CODE | |
Subject category code | UM |
Source | thema |
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
Classification number | 005.11 |
Edition number | 23 |
245 10 - TITLE STATEMENT | |
Title | Graph-Theoretic Concepts in Computer Science |
Medium | [electronic resource] : |
Remainder of title | 26th International Workshop, WG 2000 Konstanz, Germany, June 15-17, 2000 Proceedings / |
Statement of responsibility, etc | edited by Ulrik Brandes, Dorothea Wagner. |
250 ## - EDITION STATEMENT | |
Edition statement | 1st ed. 2000. |
264 #1 - | |
-- | Berlin, Heidelberg : |
-- | Springer Berlin Heidelberg : |
-- | Imprint: Springer, |
-- | 2000. |
300 ## - PHYSICAL DESCRIPTION | |
Extent | X, 313 p. |
Other physical details | online resource. |
336 ## - | |
-- | text |
-- | txt |
-- | rdacontent |
337 ## - | |
-- | computer |
-- | c |
-- | rdamedia |
338 ## - | |
-- | online resource |
-- | cr |
-- | rdacarrier |
347 ## - | |
-- | text file |
-- | |
-- | rda |
490 1# - SERIES STATEMENT | |
Series statement | Lecture Notes in Computer Science, |
International Standard Serial Number | 1611-3349 ; |
Volume number/sequential designation | 1928 |
505 0# - FORMATTED CONTENTS NOTE | |
Formatted contents note | 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. |
520 ## - SUMMARY, ETC. | |
Summary, etc | 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, and sponsored by Deutsche Forschungsgemeinschaft (DFG) and Univ- sit¨atsgesellschaft Konstanz. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in computer science, or by extracting new problems from applications. The goal is to present recent research results and to identify and explore directions for future research. The workshop looks back on a remarkable tradition of more than a quarter of a century. Previous Workshops have been organized in various places in Europe, and submissions come from all over the world. This year, 57 attendees from 13 di erent countries gathered in the relaxing atmosphere of Lake Constance, also known as the Bodensee. Out of 51 submis- ons, the program committee carefully selected 26 papers for presentation at the workshop. This selection re?ects current research directions, among them graph and network algorithms and their complexity, algorithms for special graph cl- ses, communication networks, and distributed algorithms. The present volume contains these papers together with the survey presented in an invited lecture by Ingo Wegener (University of Dortmund) and an extended abstract of the invited lecture given by Emo Welzl (ETH Zuric ¨ h). |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name as entry element | Computer programming. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name as entry element | Computer science. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name as entry element | Data structures (Computer science). |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name as entry element | Information theory. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name as entry element | Algorithms. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name as entry element | Computer science |
General subdivision | Mathematics. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name as entry element | Discrete mathematics. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name as entry element | Artificial intelligence |
General subdivision | Data processing. |
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name as entry element | Programming Techniques. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name as entry element | Theory of Computation. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name as entry element | Data Structures and Information Theory. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name as entry element | Algorithms. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name as entry element | Discrete Mathematics in Computer Science. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name as entry element | Data Science. |
700 1# - ADDED ENTRY--PERSONAL NAME | |
Personal name | Brandes, Ulrik. |
Relator term | editor. |
Relator code | edt |
-- | http://id.loc.gov/vocabulary/relators/edt |
700 1# - ADDED ENTRY--PERSONAL NAME | |
Personal name | Wagner, Dorothea. |
Relator term | editor. |
Relator code | edt |
-- | http://id.loc.gov/vocabulary/relators/edt |
710 2# - ADDED ENTRY--CORPORATE NAME | |
Corporate name or jurisdiction name as entry element | SpringerLink (Online service) |
773 0# - HOST ITEM ENTRY | |
Title | Springer Nature eBook |
776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
Display text | Printed edition: |
International Standard Book Number | 9783540411833 |
776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
Display text | Printed edition: |
International Standard Book Number | 9783662201527 |
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
Uniform title | Lecture Notes in Computer Science, |
-- | 1611-3349 ; |
Volume number/sequential designation | 1928 |
856 40 - ELECTRONIC LOCATION AND ACCESS | |
Uniform Resource Identifier | <a href="https://doi.org/10.1007/3-540-40064-8">https://doi.org/10.1007/3-540-40064-8</a> |
912 ## - | |
-- | ZDB-2-SCS |
912 ## - | |
-- | ZDB-2-SXCS |
912 ## - | |
-- | ZDB-2-LNC |
912 ## - | |
-- | ZDB-2-BAE |
942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
Koha item type | eBooks-CSE-Springer |
No items available.