Graph-Theoretic Concepts in Computer Science (Record no. 189121)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 04612nam a22006255i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 978-3-540-68072-7 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | DE-He213 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20240423132547.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 | 121227s1997 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9783540680727 |
| -- | 978-3-540-68072-7 |
| 024 7# - OTHER STANDARD IDENTIFIER | |
| Standard number or code | 10.1007/3-540-62559-3 |
| Source of number or code | doi |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | QA75.5-76.95 |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | UYA |
| Source | bicssc |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | COM014000 |
| Source | bisacsh |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | UYA |
| Source | thema |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 004.0151 |
| Edition number | 23 |
| 245 10 - TITLE STATEMENT | |
| Title | Graph-Theoretic Concepts in Computer Science |
| Medium | [electronic resource] : |
| Remainder of title | 22nd International Workshop, WG '96, Cadenabbia, Italy, June 12-14, 1996, Proceedings / |
| Statement of responsibility, etc | edited by Fabrizio D'Amore, Paolo Giulio Franciosa, Alberto Marchetti-Spaccamela. |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 1st ed. 1997. |
| 264 #1 - | |
| -- | Berlin, Heidelberg : |
| -- | Springer Berlin Heidelberg : |
| -- | Imprint: Springer, |
| -- | 1997. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | XII, 416 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 | 1197 |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Hypergraphs and decision trees -- Improved approximations of independent dominating set in bounded degree graphs -- A new characterization of P 4-connected graphs -- Node rewriting in hypergraphs -- On ?-partitioning the n-cube -- Embedding complete binary trees in product graphs -- Clique and anticlique partitions of graphs -- Optimal parallel routing in star graphs -- Counting edges in a dag -- Closure properties of context-free Hyperedge Replacement Systems -- Upward drawings of search trees -- More general parallel tree contraction: Register allocation and broadcasting in a tree -- System diagnosis with smallest risk of error -- Efficient algorithms for shortest path queries in planar digraphs -- LexBFS-orderings and powers of graphs -- Efficient Union-Find for planar graphs and other sparse graph classes -- Switchbox routing in VLSI design: Closing the complexity gap -- Detecting diamond necklaces in labeled dags -- Algebraic graph derivations for graphical calculi -- Definability equals recognizability of partial 3-trees -- One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs -- Approximate maxima finding of continuous functions under restricted budget (Extended abstract) -- The Optimal Cost Chromatic Partition problem for trees and interval graphs -- Modifying networks to obtain low cost trees -- On the hardness of allocating frequencies for hybrid networks -- Homogeneous sets and domination problems -- Independent spanning trees of product graphs -- Designing distrance-preserving fault-tolerant topologies -- Shortest path algorithms for nearly acyclic directed graphs -- Computing disjoint paths with length constraints -- Generalized edge-rankings of trees. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | This book constitutes the carefully refereed post-proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science, WG '96, held in Cadenabbia, Italy, in June 1996. The 30 revised full papers presented in the volume were selected from a total of 65 submissions. This collection documents the state of the art in the area. Among the topics addressed are graph algorithms, graph rewriting, hypergraphs, graph drawing, networking, approximation and optimization, trees, graph computation, and others. |
| 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 | Mathematics. |
| 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 | Artificial intelligence |
| General subdivision | Data processing. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer graphics. |
| 650 14 - 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 | Applications of Mathematics. |
| 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 | Data Science. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer Graphics. |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | D'Amore, Fabrizio. |
| Relator term | editor. |
| Relator code | edt |
| -- | http://id.loc.gov/vocabulary/relators/edt |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Franciosa, Paolo Giulio. |
| Relator term | editor. |
| Relator code | edt |
| -- | http://id.loc.gov/vocabulary/relators/edt |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Marchetti-Spaccamela, Alberto. |
| 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 | 9783540625599 |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Display text | Printed edition: |
| International Standard Book Number | 9783662177990 |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| Uniform title | Lecture Notes in Computer Science, |
| -- | 1611-3349 ; |
| Volume number/sequential designation | 1197 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | <a href="https://doi.org/10.1007/3-540-62559-3">https://doi.org/10.1007/3-540-62559-3</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.