Cart 0
Graph-Theoretic Concepts in Computer Science
Click to zoom

Share this book

Graph-Theoretic Concepts in Computer Science : 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers

1st ed. 2016

Book Details

Format Paperback / Softback
ISBN-10 3662531739
ISBN-13 9783662531730
Edition 1st ed. 2016
Publisher Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Country of Manufacture DE
Country of Publication GB
Publication Date Aug 5th, 2016
Print length 514 Pages
Ksh 8,100.00
Werezi Extended Catalogue Delivery in 28 days

Delivery Location

Delivery fee: Select location

Delivery in 28 days

Secure
Quality
Fast
This book constitutes revised selected papers from the 41st International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2015, held in Garching, Germany, in June 2015. The 32 papers presented in this volume were carefully reviewed and selected from 79 submissions. structural graph theory; graph drawing;

This book constitutes revised selected papers from the 41st International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2015, held in Garching, Germany, in June 2015.
The 32 papers presented in this volume were carefully reviewed and selected from 79 submissions. They were organized in topical sections named: invited talks; computational complexity; design and analysis; computational geometry; structural graph theory; graph drawing; and fixed parameter tractability. 


Get Graph-Theoretic Concepts in Computer Science by at the best price and quality guaranteed only at Werezi Africa's largest book ecommerce store. The book was published by Springer-Verlag Berlin and Heidelberg GmbH & Co. KG and it has pages.

Mind, Body, & Spirit

Price

Ksh 8,100.00

Shopping Cart

Africa largest book store

Sub Total:
Ebooks

Digital Library
Coming Soon

Our digital collection is currently being curated to ensure the best possible reading experience on Werezi. We'll be launching our Ebooks platform shortly.