Algorithm Maximal Planar Subgraph by Cai Jiazhen (4 results)

Author
Title

Refine your search

  • Books (4)

  • New (4)

to

Custom price range (£)

to

  • Language: English

    Published by Forgotten Books 2018

    133217289X / 9781332172894

    • Softcover

    Seller: PBShop.store US, Wood Dale, U.S.A.PBShop.store US

    5-star seller
    Contact seller

    Condition: New

    £ 18.71

     Free Shipping 
    Ships within U.S.A.

    Quantity: 15 available

    PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.

  • Language: English

    Published by Forgotten Books 2018

    133217289X / 9781332172894

    • Softcover

    Seller: PBShop.store UK, Fairford, United KingdomPBShop.store UK

    5-star seller
    Contact seller

    Condition: New

    £ 17.92

    £ 3.29 shipping 
    Ships from United Kingdom to U.S.A.

    Quantity: 15 available

    PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.

  • Language: English

    Published by Forgotten Books 2024

    133217289X / 9781332172894

    • Softcover
    • Print on Demand

    Seller: Forgotten Books, London, United KingdomForgotten Books

    4-star seller
    Contact seller

    Condition: New

    £ 13.18

     Free Shipping 
    Ships from United Kingdom to U.S.A.

    Quantity: Over 20 available

    Paperback. Condition: New. Print on Demand. This book presents an efficient algorithm for finding a maximal planar subgraph, pushing the boundaries of existing algorithms in this area. The maximal planar subgraph problem involves finding a subset of edges in a graph that can be removed to make the graph planar, with the goal of

  • Language: English

    Published by Palala Press 2018

    1378112512 / 9781378112519

    • Softcover
    • Print on Demand

    Seller: Majestic Books, Hounslow, United KingdomMajestic Books

    4-star seller
    Contact seller

    Condition: New

    £ 15.66

    £ 6.50 shipping 
    Ships from United Kingdom to U.S.A.

    Quantity: 4 available

    Condition: New. Print on Demand pp. 32.