Lets Explore,

Cover of An O(n Log N) Algorithm for the Maximal Planar Subgraph Problem: (English)

An O(n Log N) Algorithm for the Maximal Planar Subgraph Problem: (English)

(Paperback)

Jiazhen Cai,

Nabu Press (Publisher)

Published

2011

Reviews

0

History and Archaeology History History: theory and methods

By: Jiazhen Cai | Publisher: Nabu Press | Released: 08 Sep 2011

Ships within 12-14 days

Out Of Stock

₹992.00

₹1323.00

25% off

This is a reproduction of a book published before 1923. This book may have occasional imperfections such as missing or blurred pages, poor pictures, errant marks, etc. that were either part of the original artifact, or were introduced by the scanning process. We believe this work is culturally important, and despite the imperfections, have elected to bring it back into print as part of our continuing commitment to the preservation of printed works worldwide. We appreciate your understanding of the imperfections in the preservation process, and hope you enjoy this valuable book.

More books by Jiazhen Cai

Cover of An O(n log n) Algorithm for the Maximal Planar Subgraph Problem

An O(n log n) Algorithm for the Maximal Planar Subgraph Problem

Jiazhen Cai

₹1347.0₹1320.0

Cover of More Efficient Bottom-up Multipattern Matching in Trees

More Efficient Bottom-up Multipattern Matching in Trees

Jiazhen Cai

Cover of An O(n Log N) Algorithm for the Maximal Planar Subgraph Problem

An O(n Log N) Algorithm for the Maximal Planar Subgraph Problem

Jiazhen Cai

Cover of Counting Embeddings of Planar Graphs Using Dfs Trees (Classic Reprint)

Counting Embeddings of Planar Graphs Using Dfs Trees (Classic Reprint)

Jiazhen Cai

Cover of An O(n Log N) Algorithm for the Maximal Planar Subgraph Problem

An O(n Log N) Algorithm for the Maximal Planar Subgraph Problem

Jiazhen Cai

₹1323.0₹992.0

Cover of More Efficient Bottom-Up Multipattern Matching in Trees

More Efficient Bottom-Up Multipattern Matching in Trees

Jiazhen Cai

₹1323.0₹992.0

Cover of An O(m Log N) Time Algorithm for the Maximal Planar Subgraph Problem (Classic Reprint)

An O(m Log N) Time Algorithm for the Maximal Planar Subgraph Problem (Classic Reprint)

Jiazhen Cai

Cover of More Efficient Bottom-Up Multipattern Matching in Trees (Classic Reprint)

More Efficient Bottom-Up Multipattern Matching in Trees (Classic Reprint)

Jiazhen Cai

Cover of Counting Embeddings of Planar Graphs Using Dfs Trees (Classic Reprint)

Counting Embeddings of Planar Graphs Using Dfs Trees (Classic Reprint)

Jiazhen Cai

Cover of More Efficient Bottom-Up Multipattern Matching in Trees (Classic Reprint)

More Efficient Bottom-Up Multipattern Matching in Trees (Classic Reprint)

Jiazhen Cai

Cover of An O(m Log N) Time Algorithm for the Maximal Planar Subgraph Problem (Classic Reprint)

An O(m Log N) Time Algorithm for the Maximal Planar Subgraph Problem (Classic Reprint)

Jiazhen Cai

Cover of More Efficient Bottom-up Multipattern Matching in Trees

More Efficient Bottom-up Multipattern Matching in Trees

Jiazhen Cai

Similar Products

Cover of An O(n log n) Algorithm for the Maximal Planar Subgraph Problem

An O(n log n) Algorithm for the Maximal Planar Subgraph Problem

Jiazhen Cai

₹1347.0₹1320.0

Cover of An O(n Log N) Algorithm for the Maximal Planar Subgraph Problem

An O(n Log N) Algorithm for the Maximal Planar Subgraph Problem

Jiazhen Cai

Cover of An O(m Log N) Time Algorithm for the Maximal Planar Subgraph Problem (Classic Reprint)

An O(m Log N) Time Algorithm for the Maximal Planar Subgraph Problem (Classic Reprint)

Jiazhen Cai

Cover of An O(m Log N) Time Algorithm for the Maximal Planar Subgraph Problem (Classic Reprint)

An O(m Log N) Time Algorithm for the Maximal Planar Subgraph Problem (Classic Reprint)

Jiazhen Cai

Cover of More Efficient Bottom-up Multipattern Matching in Trees

More Efficient Bottom-up Multipattern Matching in Trees

Jiazhen Cai

Cover of More Efficient Bottom-Up Multipattern Matching in Trees

More Efficient Bottom-Up Multipattern Matching in Trees

Jiazhen Cai

₹1323.0₹992.0

Cover of More Efficient Bottom-up Multipattern Matching in Trees

More Efficient Bottom-up Multipattern Matching in Trees

Jiazhen Cai

Cover of Counting Embeddings of Planar Graphs Using Dfs Trees (Classic Reprint)

Counting Embeddings of Planar Graphs Using Dfs Trees (Classic Reprint)

Jiazhen Cai

Vidya AI