Order Total (1 Item Items):
Shipping Destination:
Graph Separators Applications by Rosenberg Arnold (27 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (27)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (19)
- As New, Fine or Near Fine (5)
- Very Good or Good (No further results match this refinement)
- Fair or Poor (No further results match this refinement)
- As Described (3)
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (10)
- Not Print on Demand (22)
Language (1)
Price
- Any Price
- Under US$ 25 (No further results match this refinement)
- US$ 25 to US$ 50 (No further results match this refinement)
- Over US$ 50
Free Shipping
Seller Location
Seller Rating
-
Condition: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
-
Condition: Used. pp. 272.
-
Condition: New.
-
-
Condition: New.
-
-
US$ 117.23
US$ 8.99 shipping
Ships from United Kingdom to U.S.A.Quantity: 1 available
Add to basketCondition: Used. pp. 272 Illus.
-
Graph Separators, with Applications (Hardcover)
Language: English
Published by Springer Science+Business Media, New York, 2001
ISBN 10: 0306464640 ISBN 13: 9780306464645
Hardcover. Condition: new. Hardcover. This text is devoted to techniques for obtaining upper and lower bounds on the sizes of graph separators - upper bounds being obtained via decomposition algorithms. The book surveys the main approaches to obtaining good graph separations, while its main focus is on techniques for deriving lower bounds on the sizes of graph separators. This asymmetry in focus reflects the perception that the work on upper bounds, or algorithms, for graph separation is much better represented in the standard theory literature than is the work on lower bounds, which we perceive as being much more scattered throughout the literature on application areas. Graph Separators with Applications is devoted to techniques for obtaining upper and lower bounds on the sizes of graph separators - upper bounds being obtained via decomposition algorithms. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
-
Condition: Used. pp. 272.
-
Graph Separators, with Applications (Frontiers in Computer Science)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 134.29
US$ 16.56 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Graph Separators, with Applications (Frontiers in Computer Science)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 134.29
US$ 16.56 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Graph Separators, With Applications
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 135.69
US$ 20.74 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Condition: New. pp. 272.
-
US$ 178.05
US$ 13.83 shipping
Ships from United Kingdom to U.S.A.Quantity: 2 available
Add to basketPaperback. Condition: Brand New. 269 pages. 9.25x6.10x0.62 inches. In Stock.
-
Graph Separators, with Applications
Language: English
Published by Springer US, Springer New York Jun 2001, 2001
ISBN 10: 0306464640 ISBN 13: 9780306464645
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. Neuware -Graph Separators with Applications is devoted to techniques for obtaining upper and lower bounds on the sizes of graph separators - upper bounds being obtained via decomposition algorithms. The book surveys the main approaches to obtaining good graph separations, while the main focus of the book is on techniques for deriving lower bounds on the sizes of graph separators. This asymmetry in focus reflects our perception that the work on upper bounds, or algorithms, for graph separation is much better represented in the standard theory literature than is the work on lower bounds, which we perceive as being much more scattered throughout the literature on application areas. Given the multitude of notions of graph separator that have been developed and studied over the past (roughly) three decades, there is a need for a central, theory-oriented repository for the mass of results. The need is absolutely critical in the area of lower-bound techniques for graph separators, since these techniques have virtually never appeared in articles having the word `separator' or any of its near-synonyms in the title. Graph Separators with Applications fills this need.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 272 pp. Englisch.
-
Graph Separators, With Applications
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 182.27
US$ 20.74 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
US$ 170.89
US$ 34.56 shipping
Ships from United Kingdom to U.S.A.Quantity: 1 available
Add to basketHardcover. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
-
Condition: As New. Unread book in perfect condition.
-
Graph Separators, with Applications
Language: English
Published by Springer US, Springer New York, 2001
ISBN 10: 0306464640 ISBN 13: 9780306464645
Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Graph Separators with Applications is devoted to techniques for obtaining upper and lower bounds on the sizes of graph separators - upper bounds being obtained via decomposition algorithms. The book surveys the main approaches to obtaining good graph separations, while the main focus of the book is on techniques for deriving lower bounds on the sizes of graph separators. This asymmetry in focus reflects our perception that the work on upper bounds, or algorithms, for graph separation is much better represented in the standard theory literature than is the work on lower bounds, which we perceive as being much more scattered throughout the literature on application areas. Given the multitude of notions of graph separator that have been developed and studied over the past (roughly) three decades, there is a need for a central, theory-oriented repository for the mass of results. The need is absolutely critical in the area of lower-bound techniques for graph separators, since these techniques have virtually never appeared in articles having the word `separator' or any of its near-synonyms in the title. Graph Separators with Applications fills this need.
-
US$ 195.10
US$ 34.56 shipping
Ships from United Kingdom to U.S.A.Quantity: 1 available
Add to basketPaperback. Condition: Like New. Like New. book.
-
Condition: As New. Unread book in perfect condition.
-
Graph Separators, with Applications (Hardcover)
Language: English
Published by Springer Science+Business Media, New York, 2001
ISBN 10: 0306464640 ISBN 13: 9780306464645
Hardcover. Condition: new. Hardcover. This text is devoted to techniques for obtaining upper and lower bounds on the sizes of graph separators - upper bounds being obtained via decomposition algorithms. The book surveys the main approaches to obtaining good graph separations, while its main focus is on techniques for deriving lower bounds on the sizes of graph separators. This asymmetry in focus reflects the perception that the work on upper bounds, or algorithms, for graph separation is much better represented in the standard theory literature than is the work on lower bounds, which we perceive as being much more scattered throughout the literature on application areas. Graph Separators with Applications is devoted to techniques for obtaining upper and lower bounds on the sizes of graph separators - upper bounds being obtained via decomposition algorithms. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
-
US$ 114.24
US$ 58.89 shipping
Ships from Germany to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Graph Separators with Applications is devoted to techniques for obtaining upper and lower bounds on the sizes of graph separators - upper bounds being obtained via decomposition algorithms. The book surveys the main approaches to obtaining good .
-
US$ 114.24
US$ 58.89 shipping
Ships from Germany to U.S.A.Quantity: Over 20 available
Add to basketGebunden. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Graph Separators with Applications is devoted to techniques for obtaining upper and lower bounds on the sizes of graph separators - upper bounds being obtained via decomposition algorithms. The book surveys the main approaches to obtaining good .
-
US$ 164.27
US$ 8.99 shipping
Ships from United Kingdom to U.S.A.Quantity: 4 available
Add to basketCondition: New. Print on Demand pp. 272 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.
-
Condition: New. PRINT ON DEMAND pp. 272.
-
Graph Separators, with Applications
Language: English
Published by Springer Science+Business Media, 2001
ISBN 10: 0306464640 ISBN 13: 9780306464645
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
US$ 164.72
US$ 32.28 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketHardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
