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

Graph-Theoretic Concepts in Computer Science.

Publisher: Springer Berlin / Heidelberg, 1997.
Series: Lecture notes in computer science.
Edition/Format:   eBook : Document : English
Summary:
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,  Read more...
Rating:

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

Subjects
More like this

Find a copy online

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
ISBN: 9783540637578 3540637575 9783540651956 3540651950 9783540625599 3540625593 9783662176962 3662176963
OCLC Number: 855378740
Description: 1 online resource
Contents: 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.
Series Title: Lecture notes in computer science.
Other Titles: Graph-Theoretic Concepts in Computer Science (Online)

Abstract:

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.

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/855378740> # Graph-Theoretic Concepts in Computer Science.
    a schema:CreativeWork, schema:MediaObject, schema:Book ;
    library:oclcnum "855378740" ;
    rdfs:seeAlso <http://experiment.worldcat.org/entity/work/data/8912602747#CreativeWork/graph_theoretic_concepts_in_computer_science_online> ; # Graph-Theoretic Concepts in Computer Science (Online)
    schema:about <http://experiment.worldcat.org/entity/work/data/8912602747#Topic/combinatorial_analysis> ; # Combinatorial analysis
    schema:about <http://experiment.worldcat.org/entity/work/data/8912602747#Topic/computer_graphics> ; # Computer graphics
    schema:about <http://experiment.worldcat.org/entity/work/data/8912602747#Topic/computer_software> ; # Computer software
    schema:about <http://experiment.worldcat.org/entity/work/data/8912602747#Topic/data_structures_computer_science> ; # Data structures (Computer science)
    schema:about <http://experiment.worldcat.org/entity/work/data/8912602747#Topic/computer_science> ; # Computer science
    schema:bookFormat schema:EBook ;
    schema:datePublished "1997" ;
    schema:description "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."@en ;
    schema:description "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."@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/8912602747> ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://experiment.worldcat.org/entity/work/data/8912602747#Series/lecture_notes_in_computer_science> ; # Lecture notes in computer science.
    schema:name "Graph-Theoretic Concepts in Computer Science."@en ;
    schema:productID "855378740" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/855378740#PublicationEvent/springer_berlin_heidelberg_1997> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/8912602747#Agent/springer_berlin_heidelberg> ; # Springer Berlin / Heidelberg
    schema:url <https://doi.org/10.1007/BFb0024481> ;
    schema:url <https://doi.org/10.1007/3-540-62559-3> ;
    schema:url <https://link.springer.com/openurl?genre=book&isbn=978-3-662-17696-2> ;
    schema:url <https://link.springer.com/openurl?genre=book&isbn=978-3-662-17799-0> ;
    schema:url <https://doi.org/10.1007/b71621> ;
    schema:url <https://link.springer.com/openurl?genre=book&isbn=978-3-662-16960-5> ;
    schema:workExample <http://dx.doi.org/10.1007/b71621> ;
    schema:workExample <http://worldcat.org/isbn/9783540637578> ;
    schema:workExample <http://worldcat.org/isbn/9783540651956> ;
    schema:workExample <http://dx.doi.org/10.1007/3-540-62559-3> ;
    schema:workExample <http://worldcat.org/isbn/9783662176962> ;
    schema:workExample <http://worldcat.org/isbn/9783540625599> ;
    schema:workExample <http://dx.doi.org/10.1007/BFb0024481> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/855378740> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/8912602747#Agent/springer_berlin_heidelberg> # Springer Berlin / Heidelberg
    a bgn:Agent ;
    schema:name "Springer Berlin / Heidelberg" ;
    .

<http://experiment.worldcat.org/entity/work/data/8912602747#CreativeWork/graph_theoretic_concepts_in_computer_science_online> # Graph-Theoretic Concepts in Computer Science (Online)
    a schema:CreativeWork ;
    schema:name "Graph-Theoretic Concepts in Computer Science (Online)" ;
    .

<http://experiment.worldcat.org/entity/work/data/8912602747#Series/lecture_notes_in_computer_science> # Lecture notes in computer science.
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/855378740> ; # Graph-Theoretic Concepts in Computer Science.
    schema:name "Lecture notes in computer science." ;
    schema:name "Lecture Notes in Computer Science" ;
    .

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

<http://experiment.worldcat.org/entity/work/data/8912602747#Topic/computer_graphics> # Computer graphics
    a schema:Intangible ;
    schema:name "Computer graphics"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/8912602747#Topic/computer_software> # Computer software
    a schema:Intangible ;
    schema:name "Computer software"@en ;
    .

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

<http://worldcat.org/isbn/9783540625599>
    a schema:ProductModel ;
    schema:isbn "3540625593" ;
    schema:isbn "9783540625599" ;
    .

<http://worldcat.org/isbn/9783540637578>
    a schema:ProductModel ;
    schema:isbn "3540637575" ;
    schema:isbn "9783540637578" ;
    .

<http://worldcat.org/isbn/9783540651956>
    a schema:ProductModel ;
    schema:isbn "3540651950" ;
    schema:isbn "9783540651956" ;
    .

<http://worldcat.org/isbn/9783662176962>
    a schema:ProductModel ;
    schema:isbn "3662176963" ;
    schema:isbn "9783662176962" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

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