skip to content
Graph-Theoretic Concepts in Computer Science. Preview this item
ClosePreview this item
Checking...

Graph-Theoretic Concepts in Computer Science.

Author: R H Mohring; Rolf H Möhring
Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1991.
Series: Lecture notes in computer science, 484.
Edition/Format:   eBook : Document : EnglishView all editions and formats
Summary:
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  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Material Type: Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: R H Mohring; Rolf H Möhring
ISBN: 3540538321 9783540538325 9783662206829 366220682X
OCLC Number: 990722876
Language Note: English.
Notes: Bibliographic Level Mode of Issuance: Monograph.
Description: 1 online resource (XIII, 367 p.)
Contents: 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.
Series Title: Lecture notes in computer science, 484.
Other Titles: Proceedings

Abstract:

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.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/990722876> # Graph-Theoretic Concepts in Computer Science.
    a schema:MediaObject, schema:CreativeWork, schema:Book ;
    library:oclcnum "990722876" ;
    schema:about <http://dewey.info/class/004.0151/e23/> ;
    schema:about <http://experiment.worldcat.org/entity/work/data/2763260339#Topic/logic_design> ; # Logic design
    schema:about <http://experiment.worldcat.org/entity/work/data/2763260339#Topic/computers> ; # Computers
    schema:about <http://experiment.worldcat.org/entity/work/data/2763260339#Topic/combinatorial_analysis> ; # Combinatorial analysis
    schema:about <http://experiment.worldcat.org/entity/work/data/2763260339#Topic/computer_science> ; # Computer science
    schema:about <http://experiment.worldcat.org/entity/work/data/2763260339#Topic/data_structures_computer_science> ; # Data structures (Computer science)
    schema:about <http://experiment.worldcat.org/entity/work/data/2763260339#Topic/data_structures> ; # Data Structures
    schema:about <http://experiment.worldcat.org/entity/work/data/2763260339#Topic/algorithm_analysis_and_problem_complexity> ; # Algorithm Analysis and Problem Complexity
    schema:about <http://experiment.worldcat.org/entity/work/data/2763260339#Topic/algorithms> ; # Algorithms
    schema:about <http://experiment.worldcat.org/entity/work/data/2763260339#Topic/combinatorics> ; # Combinatorics
    schema:about <http://experiment.worldcat.org/entity/work/data/2763260339#Topic/theory_of_computation> ; # Theory of Computation
    schema:about <http://experiment.worldcat.org/entity/work/data/2763260339#Topic/computation_by_abstract_devices> ; # Computation by Abstract Devices
    schema:alternateName "Proceedings" ;
    schema:bookFormat schema:EBook ;
    schema:contributor <http://experiment.worldcat.org/entity/work/data/2763260339#Person/mohring_rolf_h> ; # Rolf H. Möhring
    schema:creator <http://experiment.worldcat.org/entity/work/data/2763260339#Meeting/international_workshop_wg> ; # International Workshop WG.
    schema:creator <http://experiment.worldcat.org/entity/work/data/2763260339#Person/mohring_r_h> ; # R. H Mohring
    schema:datePublished "1991" ;
    schema:description "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."@en ;
    schema:description "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."@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/2763260339> ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://worldcat.org/issn/0302-9743> ; # Lecture notes in computer science ;
    schema:name "Graph-Theoretic Concepts in Computer Science."@en ;
    schema:numberOfPages "367" ;
    schema:productID "990722876" ;
    schema:url <https://link.springer.com/openurl?genre=book&isbn=978-3-662-20682-9> ;
    schema:workExample <http://worldcat.org/isbn/9783662206829> ;
    schema:workExample <http://worldcat.org/isbn/9783540538325> ;
    schema:workExample <http://dx.doi.org/10.1007/3-540-53832-1> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/990722876> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/2763260339#Meeting/international_workshop_wg> # International Workshop WG.
    a bgn:Meeting, schema:Event ;
    schema:name "International Workshop WG." ;
    .

<http://experiment.worldcat.org/entity/work/data/2763260339#Person/mohring_r_h> # R. H Mohring
    a schema:Person ;
    schema:familyName "Mohring" ;
    schema:givenName "R. H." ;
    schema:name "R. H Mohring" ;
    .

<http://experiment.worldcat.org/entity/work/data/2763260339#Person/mohring_rolf_h> # Rolf H. Möhring
    a schema:Person ;
    schema:familyName "Möhring" ;
    schema:givenName "Rolf H." ;
    schema:name "Rolf H. Möhring" ;
    .

<http://experiment.worldcat.org/entity/work/data/2763260339#Topic/algorithm_analysis_and_problem_complexity> # Algorithm Analysis and Problem Complexity
    a schema:Intangible ;
    schema:name "Algorithm Analysis and Problem Complexity"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/2763260339#Topic/combinatorial_analysis> # Combinatorial analysis
    a schema:Intangible ;
    schema:name "Combinatorial analysis"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/2763260339#Topic/computation_by_abstract_devices> # Computation by Abstract Devices
    a schema:Intangible ;
    schema:name "Computation by Abstract Devices"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/2763260339#Topic/computer_science> # Computer science
    a schema:Intangible ;
    schema:name "Computer science"@en ;
    schema:name "Computer Science"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/2763260339#Topic/data_structures_computer_science> # Data structures (Computer science)
    a schema:Intangible ;
    schema:name "Data structures (Computer science)"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/2763260339#Topic/logic_design> # Logic design
    a schema:Intangible ;
    schema:name "Logic design"@en ;
    schema:name "Logic Design"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/2763260339#Topic/theory_of_computation> # Theory of Computation
    a schema:Intangible ;
    schema:name "Theory of Computation"@en ;
    .

<http://worldcat.org/isbn/9783540538325>
    a schema:ProductModel ;
    schema:isbn "3540538321" ;
    schema:isbn "9783540538325" ;
    .

<http://worldcat.org/isbn/9783662206829>
    a schema:ProductModel ;
    schema:isbn "366220682X" ;
    schema:isbn "9783662206829" ;
    .

<http://worldcat.org/issn/0302-9743> # Lecture notes in computer science ;
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/990722876> ; # Graph-Theoretic Concepts in Computer Science.
    schema:issn "0302-9743" ;
    schema:name "Lecture notes in computer science ;" ;
    schema:name "Lecture Notes in Computer Science," ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.