skip to content
Graph-Theoretic Concepts in Computer Science : 23rd International Workshop, WG'97 Berlin, Germany, June 1820, 1997 Proceedings Preview this item
ClosePreview this item
Checking...

Graph-Theoretic Concepts in Computer Science : 23rd International Workshop, WG'97 Berlin, Germany, June 1820, 1997 Proceedings

Author: Rolf H Mhring
Publisher: Berlin ; Heidelberg : Springer-Verlag, 1997.
Series: Lecture notes in computer science, 1335
Edition/Format:   eBook : Document : EnglishView all editions and formats
Summary:
This book constitutes the strictly refereed post-workshop proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG'97, held in Berlin, Germany in June 1997. The volume presents 28 revised full papers carefully selected for inclusion in the book from 42 submissions. The papers address a variety of graph-theoretic issues relevant from the computer science point of view such as  Read more...
Rating:

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

Subjects
More like this

 

Find a copy in the library

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

Details

Genre/Form: Electronic books
Additional Physical Format: Printed edition:
Material Type: Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Rolf H Mhring
ISBN: 9783540696438 3540696431
OCLC Number: 769770668
Description: 1 online resource.
Contents: Gadgets, approximation, and linear programming: Improved hardness results for cut and satisfiability problems --
Non-oblivious local search for MAX 2-CCSP with application to MAX DICUT --
On the number of simple cycles in planar graphs --
On the separable-homogeneous decomposition of graphs --
Pseudo-hamiltonian graphs --
Acyclic orientations for deadlock prevention in interconnection networks --
Weak-order extensions of an order --
An upper bound for the maximum cut mean value --
NP-completeness results for minimum planar spanners --
Computing the independence number of dense triangle-free graphs --
Algorithms for the treewidth and minimum fill-in of HHD-free graphs --
Block decomposition of inheritance hierarchies --
Minimal elimination ordering inside a given chordal graph --
On-line algorithms for networks of temporal constraints --
Parallel algorithms for treewidth two --
On optimal graphs embedded into paths and rings, with analysis using l 1-spheres --
On greedy matching ordering and greedy matchable graphs --
Off-line and on-line call-scheduling in stars and trees --
Computational complexity of the Krausz dimension of graphs --
Asteroidal sets in graphs --
Complexity of colored graph covers I. Colored directed multigraphs --
A syntactic approach to random walks on graphs --
Bicliques in graphs II: Recognizing k-path graphs and underlying graphs of line digraphs --
Large networks with small diameter --
The bounded tree-width problem of context-free graph languages --
Structured programs have small tree-width and good register allocation --
A measure of parallelization for the lexicographically first maximal subgraph problems --
Make your enemies transparent --
Optimal fault-tolerant ATM-routings for biconnected graphs.
Series Title: Lecture notes in computer science, 1335
Responsibility: edited by Rolf H. Mhring.

Abstract:

This book constitutes the strictly refereed post-workshop proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG'97, held in Berlin, Germany in June 1997. The volume presents 28 revised full papers carefully selected for inclusion in the book from 42 submissions. The papers address a variety of graph-theoretic issues relevant from the computer science point of view such as graph algorithms, cycles, graph decompositions, interconnection networks, local search, graph orderings, graph matching, graph languages, tree-width computation, etc.

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/769770668> # Graph-Theoretic Concepts in Computer Science : 23rd International Workshop, WG'97 Berlin, Germany, June 1820, 1997 Proceedings
    a schema:MediaObject, schema:Book, schema:CreativeWork ;
    library:oclcnum "769770668" ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/837028316#Place/heidelberg> ; # Heidelberg
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/837028316#Place/berlin> ; # Berlin
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/gw> ;
    schema:about <http://id.worldcat.org/fast/872451> ; # Computer science
    schema:about <http://id.worldcat.org/fast/872527> ; # Computer software
    schema:about <http://id.worldcat.org/fast/887978> ; # Data structures (Computer science)
    schema:about <http://dewey.info/class/004.015115/e21/> ;
    schema:about <http://id.worldcat.org/fast/871991> ; # Computational complexity
    schema:about <http://id.worldcat.org/fast/868961> ; # Combinatorial analysis
    schema:bookFormat schema:EBook ;
    schema:contributor <http://experiment.worldcat.org/entity/work/data/837028316#Person/mhring_rolf_h> ; # Rolf H. Mhring
    schema:datePublished "1997" ;
    schema:description "Gadgets, approximation, and linear programming: Improved hardness results for cut and satisfiability problems -- Non-oblivious local search for MAX 2-CCSP with application to MAX DICUT -- On the number of simple cycles in planar graphs -- On the separable-homogeneous decomposition of graphs -- Pseudo-hamiltonian graphs -- Acyclic orientations for deadlock prevention in interconnection networks -- Weak-order extensions of an order -- An upper bound for the maximum cut mean value -- NP-completeness results for minimum planar spanners -- Computing the independence number of dense triangle-free graphs -- Algorithms for the treewidth and minimum fill-in of HHD-free graphs -- Block decomposition of inheritance hierarchies -- Minimal elimination ordering inside a given chordal graph -- On-line algorithms for networks of temporal constraints -- Parallel algorithms for treewidth two -- On optimal graphs embedded into paths and rings, with analysis using l 1-spheres -- On greedy matching ordering and greedy matchable graphs -- Off-line and on-line call-scheduling in stars and trees -- Computational complexity of the Krausz dimension of graphs -- Asteroidal sets in graphs -- Complexity of colored graph covers I. Colored directed multigraphs -- A syntactic approach to random walks on graphs -- Bicliques in graphs II: Recognizing k-path graphs and underlying graphs of line digraphs -- Large networks with small diameter -- The bounded tree-width problem of context-free graph languages -- Structured programs have small tree-width and good register allocation -- A measure of parallelization for the lexicographically first maximal subgraph problems -- Make your enemies transparent -- Optimal fault-tolerant ATM-routings for biconnected graphs."@en ;
    schema:description "This book constitutes the strictly refereed post-workshop proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG'97, held in Berlin, Germany in June 1997. The volume presents 28 revised full papers carefully selected for inclusion in the book from 42 submissions. The papers address a variety of graph-theoretic issues relevant from the computer science point of view such as graph algorithms, cycles, graph decompositions, interconnection networks, local search, graph orderings, graph matching, graph languages, tree-width computation, etc."@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/837028316> ;
    schema:genre "Electronic books"@en ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://worldcat.org/issn/0302-9743> ; # Lecture notes in computer science ;
    schema:isSimilarTo <http://worldcat.org/entity/work/data/837028316#CreativeWork/> ;
    schema:name "Graph-Theoretic Concepts in Computer Science : 23rd International Workshop, WG'97 Berlin, Germany, June 1820, 1997 Proceedings"@en ;
    schema:productID "769770668" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/769770668#PublicationEvent/berlin_heidelberg_springer_verlag_1997> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/837028316#Agent/springer_verlag> ; # Springer-Verlag
    schema:url <http://dx.doi.org/10.1007/BFb0024481> ;
    schema:url <http://gate.lib.buffalo.edu/login?url=https://link.springer.com/book/10.1007/BFb0024481> ;
    schema:url <http://link.springer.com/10.1007/BFb0024481> ;
    schema:url <http://link.springer.com/openurl?genre=book&isbn=978-3-540-63757-8> ;
    schema:workExample <http://dx.doi.org/10.1007/BFb0024481> ;
    schema:workExample <http://worldcat.org/isbn/9783540696438> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/769770668> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/837028316#Agent/springer_verlag> # Springer-Verlag
    a bgn:Agent ;
    schema:name "Springer-Verlag" ;
    .

<http://experiment.worldcat.org/entity/work/data/837028316#Person/mhring_rolf_h> # Rolf H. Mhring
    a schema:Person ;
    schema:familyName "Mhring" ;
    schema:givenName "Rolf H." ;
    schema:name "Rolf H. Mhring" ;
    .

<http://id.worldcat.org/fast/868961> # Combinatorial analysis
    a schema:Intangible ;
    schema:name "Combinatorial analysis"@en ;
    .

<http://id.worldcat.org/fast/871991> # Computational complexity
    a schema:Intangible ;
    schema:name "Computational complexity"@en ;
    .

<http://id.worldcat.org/fast/872451> # Computer science
    a schema:Intangible ;
    schema:name "Computer science"@en ;
    .

<http://id.worldcat.org/fast/872527> # Computer software
    a schema:Intangible ;
    schema:name "Computer software"@en ;
    .

<http://id.worldcat.org/fast/887978> # Data structures (Computer science)
    a schema:Intangible ;
    schema:name "Data structures (Computer science)"@en ;
    .

<http://worldcat.org/entity/work/data/837028316#CreativeWork/>
    a schema:CreativeWork ;
    schema:description "Printed edition:" ;
    schema:isSimilarTo <http://www.worldcat.org/oclc/769770668> ; # Graph-Theoretic Concepts in Computer Science : 23rd International Workshop, WG'97 Berlin, Germany, June 1820, 1997 Proceedings
    .

<http://worldcat.org/isbn/9783540696438>
    a schema:ProductModel ;
    schema:isbn "3540696431" ;
    schema:isbn "9783540696438" ;
    .

<http://worldcat.org/issn/0302-9743> # Lecture notes in computer science ;
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/769770668> ; # Graph-Theoretic Concepts in Computer Science : 23rd International Workshop, WG'97 Berlin, Germany, June 1820, 1997 Proceedings
    schema:issn "0302-9743" ;
    schema:name "Lecture notes in computer science ;" ;
    schema:name "Lecture Notes in Computer Science ;" ;
    .

<http://www.worldcat.org/title/-/oclc/769770668>
    a genont:InformationResource, genont:ContentTypeGenericResource ;
    schema:about <http://www.worldcat.org/oclc/769770668> ; # Graph-Theoretic Concepts in Computer Science : 23rd International Workshop, WG'97 Berlin, Germany, June 1820, 1997 Proceedings
    schema:dateModified "2018-02-09" ;
    void:inDataset <http://purl.oclc.org/dataset/WorldCat> ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

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