Graph-Theoretic Concepts in Computer Science

15th International Workshop WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989, Proceedings (Lecture Notes in Computer Science)

1 edition
  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read
Not in Library

My Reading Lists:

Create a new list

Check-In

×Close
Add an optional check-in date. Check-in dates are used to track yearly reading goals.
Today

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read


Download Options

Buy this book

Last edited by ImportBot
October 4, 2021 | History

Graph-Theoretic Concepts in Computer Science

15th International Workshop WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989, Proceedings (Lecture Notes in Computer Science)

1 edition
  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read

This edition doesn't have a description yet. Can you add one?

Publish Date
Publisher
Springer
Language
English
Pages
374

Buy this book

Previews available in: English

Book Details


First Sentence

"In this paper we study the problem of finding disjoint paths in a hypercube."

Classifications

Library of Congress
QA166 .G7172 1990, QA75.5-76.95

The Physical Object

Format
Paperback
Number of pages
374
Dimensions
9.4 x 6.4 x 0.9 inches
Weight
1.5 pounds

ID Numbers

Open Library
OL9589892M
Internet Archive
graphtheoreticco00nagl
ISBN 10
3540522921
ISBN 13
9783540522928
LCCN
90009493

First Sentence

"In this paper we study the problem of finding disjoint paths in a hypercube."

Community Reviews (0)

Feedback?
No community reviews have been submitted for this work.

Lists

This work does not appear on any lists.

History

Download catalog record: RDF / JSON / OPDS | Wikipedia citation
October 4, 2021 Edited by ImportBot import existing book
August 15, 2021 Edited by MARC Bot import existing book
January 5, 2020 Edited by ImportBot import existing book
June 30, 2019 Edited by MARC Bot import existing book
April 30, 2008 Created by an anonymous user Imported from amazon.com record.