你好! Shipping to Taiwan with premium packaging for just NT$300 

Ship to
Taiwan
0

My Account

  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

menu

Select your country

Americas

Europe

Rest of the world

portada Minimum Edge-Ranking Spanning Tree Problem of Series-Parallel Graphs: Finding NP Completeness, Efficient Approximation Algorithm and the Ratio
Type
Physical Book
Publisher
Author
Format
Paperback
ISBN13
9783639196849

Minimum Edge-Ranking Spanning Tree Problem of Series-Parallel Graphs: Finding NP Completeness, Efficient Approximation Algorithm and the Ratio

Ahmed Shamsul Arefin (Author) · Vdm Verlag · Paperback

Minimum Edge-Ranking Spanning Tree Problem of Series-Parallel Graphs: Finding NP Completeness, Efficient Approximation Algorithm and the Ratio - Ahmed Shamsul Arefin

New Book Imported to Taiwan
Delivery: 15 Oct - 28 Oct Shipping: 12 to 16 business days.
NT$ 2,011
NT$ 2,011

Choose the list to add your product or create one New List

Go to My Wishlists
Calculate shipping cost

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

What is the format of this book?

The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews