Humburger Icon
Logo1
Login & Sign up
Bookswagon-24x7 online bookstore
AddBanner
Home icon Home
Account Icon Account
Wishlist Icon Wishlist
Cart Icon Cart
Bookswagon icon Categories
Close

Refine your Search

By Price

Availability

Shipping Time

Source

Binding

Language

Publication Year

Filter By Category
Jiazhen Cai

Jiazhen Cai

12 results found
List viewGrid view
Sort By:
1.
O(n log n) Algorithm for the Maximal Planar Subgraph Problem3 % NR
O(n log n) Algorithm for the Maximal Planar Subgraph Problem
By: Jiazhen Cai, Xiaofeng Han, Robert E Tarjan
Publisher: Creative Media Partners, LLC
No Review Yet
₹1,186
₹1,150
Binding:
Paperback
Release:
19 Feb 2018
Language:
English
International Edition
Ships within 12-14 Days Explain..
Free Shipping in India and low cost Worldwide.
2.
More Efficient Bottom-up Multipattern Matching in Trees2 % POD/NR
More Efficient Bottom-up Multipattern Matching in Trees
By: Jiazhen Cai, Robert Paige, Robert E Tarjan
Publisher: Palala Press
No Review Yet
₹2,291
₹2,245
Binding:
Hardback
Release:
11 Sep 2015
Language:
English
International Edition
Ships within 12-14 Days Explain..
Free Shipping in India and low cost Worldwide.
Print On Demand
Print On Demand (POD) titles : are those which have been especially printed by the Publisher / Vendor partner only after an order for them has been received. They are also classified as Non-Returnable.
Non-Returnable titles : are those which have been classified as Non-Returnable under any circumstance by International Publishers / Vendor partners.
3.
O(n Log N) Algorithm for the Maximal Planar Subgraph Problem
O(n Log N) Algorithm for the Maximal Planar Subgraph Problem
By: Jiazhen Cai, Xiaofeng Han, Robert E Tarjan
Publisher: Palala Press
No Review Yet
₹1,170
Binding:
Hardback
Release:
09 Sep 2015
Language:
English
Out of Stock
Notify me when this book is in stockNotify Me
4.
More Efficient Bottom-up Multipattern Matching in TreesPOD/NR
More Efficient Bottom-up Multipattern Matching in Trees
By: Jiazhen Cai, Robert Paige, Robert E Tarjan
Publisher: Palala Press
No Review Yet
₹874
Binding:
Paperback
Release:
03 Mar 2018
Language:
English
Out of Stock
Notify me when this book is in stockNotify Me
Print On Demand
Print On Demand (POD) titles : are those which have been especially printed by the Publisher / Vendor partner only after an order for them has been received. They are also classified as Non-Returnable.
Non-Returnable titles : are those which have been classified as Non-Returnable under any circumstance by International Publishers / Vendor partners.
5.
Counting Embeddings of Planar Graphs Using Dfs Trees (Classic Reprint)NR
Counting Embeddings of Planar Graphs Using Dfs Trees (Classic Reprint)
By: Jiazhen Cai
Publisher: Forgotten Books
No Review Yet
₹2,447
Binding:
Hardback
Release:
31 Jul 2018
Language:
English
Out of Stock
Notify me when this book is in stockNotify Me
6.
More Efficient Bottom-Up Multipattern Matching in Trees (Classic Reprint)NR
More Efficient Bottom-Up Multipattern Matching in Trees (Classic Reprint)
By: Jiazhen Cai
Publisher: Forgotten Books
No Review Yet
₹2,487
Binding:
Hardback
Release:
10 Sep 2018
Language:
English
Out of Stock
Notify me when this book is in stockNotify Me
7.
Counting Embeddings of Planar Graphs Using Dfs Trees (Classic Reprint)NR
Counting Embeddings of Planar Graphs Using Dfs Trees (Classic Reprint)
By: Jiazhen Cai
Publisher: Forgotten Books
No Review Yet
₹826
Binding:
Paperback
Release:
31 Jul 2018
Language:
English
Out of Stock
Notify me when this book is in stockNotify Me
8.
An O(m Log N) Time Algorithm for the Maximal Planar Subgraph Problem (Classic Reprint)NR
An O(m Log N) Time Algorithm for the Maximal Planar Subgraph Problem (Classic Reprint)
By: Jiazhen Cai
Publisher: Forgotten Books
No Review Yet
₹2,452
Binding:
Hardback
Release:
03 May 2018
Language:
English
Out of Stock
Notify me when this book is in stockNotify Me
9.
More Efficient Bottom-Up Multipattern Matching in Trees (Classic Reprint)NR
More Efficient Bottom-Up Multipattern Matching in Trees (Classic Reprint)
By: Jiazhen Cai
Publisher: Forgotten Books
No Review Yet
₹974
Binding:
Paperback
Release:
10 Sep 2018
Language:
English
Out of Stock
Notify me when this book is in stockNotify Me
10.
An O(m Log N) Time Algorithm for the Maximal Planar Subgraph Problem (Classic Reprint)NR
An O(m Log N) Time Algorithm for the Maximal Planar Subgraph Problem (Classic Reprint)
By: Jiazhen Cai
Publisher: Forgotten Books
No Review Yet
₹827
Binding:
Paperback
Release:
03 May 2018
Language:
English
Out of Stock
Notify me when this book is in stockNotify Me
11.
More Efficient Bottom-Up Multipattern Matching in Trees25 % NR
More Efficient Bottom-Up Multipattern Matching in Trees
By: Jiazhen Cai
Publisher: Nabu Press
No Review Yet
₹1,323
₹992
Binding:
Paperback
Release:
03 Sep 2011
Language:
English
Out of Stock
Notify me when this book is in stockNotify Me
12.
An O(n Log N) Algorithm for the Maximal Planar Subgraph Problem25 % NR
An O(n Log N) Algorithm for the Maximal Planar Subgraph Problem
By: Jiazhen Cai
Publisher: Nabu Press
No Review Yet
₹1,323
₹992
Binding:
Paperback
Release:
08 Sep 2011
Language:
English
Out of Stock
Notify me when this book is in stockNotify Me
No more records found