Editors:
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 790)
Conference series link(s): WG: International Workshop on Graph-Theoretic Concepts in Computer Science
Conference proceedings info: WG 1993.
Buying options
This is a preview of subscription content, access via your institution.
Table of contents (35 papers)
-
Front Matter
About this book
The papers are grouped into parts on: hard problems on classes of graphs, structural graph theory, dynamic graph algorithms, structure-oriented graph algorithms, graph coloring, AT-free and chordal graphs, circuits and nets, graphs and interconnection networks, routing and shortest paths, and graph embedding and layout.
The 35 revised papers were chosen from 92 submissions after a careful refereeing process.
Keywords
- Graph
- Graph-Algorithmen
- Kombinatorische Algorithmen
- Layout
- algorithm
- algorithms
- combinatorial algorithms
- distributed algorithms
- graph algorithms
- graph theory
- network theory
- algorithm analysis and problem complexity
- combinatorics
Bibliographic Information
Book Title: Graph-Theoretic Concepts in Computer Science
Book Subtitle: 19th International Workshop, WG '93, Utrecht, The Netherlands, June 16 - 18, 1993. Proceedings
Editors: Jan Leeuwen
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-57899-4
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1994
Softcover ISBN: 978-3-540-57899-4Published: 20 May 1994
eBook ISBN: 978-3-540-48385-4Published: 29 June 2005
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XI, 437
Topics: Theory of Computation, Discrete Mathematics, Computer and Information Systems Applications, Algorithms, Computer Science Logic and Foundations of Programming