Graph-Theoretic Concepts in Computer Science 16th International Workshop WG '90, Berlin, Germany, June 20-22, 1990 / edited by Rolf H. Möhring.

This volume gives the proceedings of WG '90, the 16th in a series of workshops. The aim of the workshop series is to contribute to integration in computer science by applying graph-theoretic concepts. The workshops are unusual in that they combine theoretical aspects with practice and applicati...

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Möhring, Rolf H. (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1991.
Edition:1st ed. 1991.
Series:Lecture Notes in Computer Science, 484
Springer eBook Collection.
Subjects:
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.

MARC

LEADER 00000nam a22000005i 4500
001 b3223612
003 MWH
005 20191022033343.0
007 cr nn 008mamaa
008 121227s1991 gw | s |||| 0|eng d
020 |a 9783540463108 
024 7 |a 10.1007/3-540-53832-1  |2 doi 
035 |a (DE-He213)978-3-540-46310-8 
050 4 |a E-Book 
072 7 |a UY  |2 bicssc 
072 7 |a COM014000  |2 bisacsh 
072 7 |a UY  |2 thema 
072 7 |a UYA  |2 thema 
245 1 0 |a Graph-Theoretic Concepts in Computer Science  |h [electronic resource] :  |b 16th International Workshop WG '90, Berlin, Germany, June 20-22, 1990 /  |c edited by Rolf H. Möhring. 
250 |a 1st ed. 1991. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 1991. 
300 |a XIII, 367 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 484 
490 1 |a Springer eBook Collection 
505 0 |a Optimal parallel algorithms for sparse graphs -- Finding minimally weighted subgraphs -- On the complexity of some coloring games -- A generalized best-first search method in graphs -- Avoiding matrix multiplication -- Induced subraph isomorphism for cographs is NP-complete -- On feedback problems in planar digraphs -- Recognizing binary hamming graphs in O(n 2 log n) time -- Vertex-disjoint trees and boundary single-layer routing -- Bounds on the quality of approximate solutions to the group Steiner problem -- Two polynomial problems in PLA folding -- The VLSI layout problem in various embedding models -- Approximating the minimum net expansion: Near optimal solutions to circuit partitioning problems -- Deterministic message routing in faulty hypercubes -- On complexity of a message-routing strategy for multicomputer systems -- Embeddings of treelike graphs into 2-dimensional meshes -- Diagnosis of t/s-diagnosable systems -- Deciding 1-solvability of distributed task is NP-hard -- Remarks on some concurrency measures -- On the rectilinear art gallery problem algorithmic aspects -- Separation problems and circular arc systems -- Genus of orders and lattices -- Comparing the expressibility of two languages formed using NP-complete graph operators -- Decomposition of linear recursive logic programs -- On the transition graphs of automata and grammars -- Algebraic approach to graph transformation based on single pushout derivations. 
520 |a This volume gives the proceedings of WG '90, the 16th in a series of workshops. The aim of the workshop series is to contribute to integration in computer science by applying graph-theoretic concepts. The workshops are unusual in that they combine theoretical aspects with practice and applications. The volume is organized into sections on: - Graph algorithms and complexity, - VLSI layout, - Multiprocessor systems and concurrency, - Computational geometry, - Graphs, languages and databases, - Graph grammars. The volume contains revised versions of nearly all the papers presented at the workshop. Several papers take the form of preliminary reports on ongoing research. 
590 |a Loaded electronically. 
590 |a Electronic access restricted to members of the Holy Cross Community. 
650 0 |a Computers. 
650 0 |a Algorithms. 
650 0 |a Combinatorics. 
650 0 |a Data structures (Computer science). 
650 0 |a Logic design. 
690 |a Electronic resources (E-books) 
700 1 |a Möhring, Rolf H.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 484 
830 0 |a Springer eBook Collection. 
856 4 0 |u https://holycross.idm.oclc.org/login?auth=cas&url=https://doi.org/10.1007/3-540-53832-1  |3 Click to view e-book  |t 0 
907 |a .b32236128  |b 04-18-22  |c 02-26-20 
998 |a he  |b 02-26-20  |c m  |d @   |e -  |f eng  |g gw   |h 0  |i 1 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
912 |a ZDB-2-BAE 
950 |a Computer Science (Springer-11645) 
902 |a springer purchased ebooks 
903 |a SEB-COLL 
945 |f  - -   |g 1  |h 0  |j  - -   |k  - -   |l he   |o -  |p $0.00  |q -  |r -  |s b   |t 38  |u 0  |v 0  |w 0  |x 0  |y .i21367772  |z 02-26-20 
999 f f |i 2745565f-7f63-5d7e-a8a9-6b7b215aa66d  |s f345c6dd-4542-53e9-bacb-440e994ddca2  |t 0 
952 f f |p Online  |a College of the Holy Cross  |b Main Campus  |c E-Resources  |d Online  |t 0  |e E-Book  |h Library of Congress classification  |i Elec File