My Account Log in

1 option

Graph-Theoretic Concepts in Computer Science : 22nd International Workshop, WG '96, Cadenabbia, Italy, June 12-14, 1996, Proceedings / edited by Fabrizio D'Amore, Paolo Giulio Franciosa, Alberto Marchetti-Spaccamela.

LIBRA Q341 .P7 2004
Loading location information...

Available from offsite location This item is stored in our repository but can be checked out.

Log in to request item
Format:
Book
Contributor:
D'Amore, Fabrizio, editor.
Franciosa, Paolo Giulio, editor.
Marchetti-Spaccamela, Alberto, editor.
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
Lecture notes in computer science 0302-9743 ; 1197.
Lecture Notes in Computer Science, 0302-9743 ; 1197
Language:
English
Subjects (All):
Computers.
Applied mathematics.
Engineering mathematics.
Algorithms.
Data structures (Computer science).
Computer graphics.
Theory of Computation.
Applications of Mathematics.
Algorithm Analysis and Problem Complexity.
Computation by Abstract Devices.
Data Structures.
Computer Graphics.
Local Subjects:
Theory of Computation.
Applications of Mathematics.
Algorithm Analysis and Problem Complexity.
Computation by Abstract Devices.
Data Structures.
Computer Graphics.
Physical Description:
1 online resource (XII, 416 pages).
Edition:
First edition 1997.
Contained In:
Springer eBooks
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1997.
System Details:
text file PDF
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, hypergraphs, graph drawing, networking, approximation and optimization, trees, graph computation, and others.
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.
Other Format:
Printed edition:
ISBN:
978-3-540-68072-7
9783540680727
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

We want your feedback!

Thanks for using the Penn Libraries new search tool. We encourage you to submit feedback as we continue to improve the site.

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Library Catalog Using Articles+ Library Account