Abbey's Bookshop Logo
Go to my checkout basket
Login to Abbey's Bookshop
Register with Abbey's Bookshop
Gift Vouchers
Browse by Category

facebook
Google Book Preview
Crossing Numbers of Graphs
— —
Marcus Schaefer (DePaul University, Chicago, Illinois, USA)
Crossing Numbers of Graphs by Marcus Schaefer (DePaul University, Chicago, Illinois, USA) at Abbey's Bookshop,

Crossing Numbers of Graphs

Marcus Schaefer (DePaul University, Chicago, Illinois, USA)


9781498750493

Productivity Press


Combinatorics & graph theory;
Algorithms & data structures


Hardback

350 pages

$168.00
We can order this in for you
How long will it take?
order qty:  
Add this item to my basket

Crossing Numbers of Graphs is the first book devoted to the crossing number, an increasingly popular object of study with surprising connections. The field has matured into a large body of work, which includes identifiable core results and techniques. The book presents a wide variety of ideas and techniques in topological graph theory, discrete geometry, and computer science.

By:   Marcus Schaefer (DePaul University Chicago Illinois USA)
Imprint:   Productivity Press
Country of Publication:   United States
Dimensions:   Height: 235mm,  Width: 156mm, 
Weight:   703g
ISBN:   9781498750493
ISBN 10:   1498750494
Series:   Discrete Mathematics and Its Applications
Pages:   350
Publication Date:   December 2017
Audience:   College/higher education ,  Primary
Format:   Hardback
Publisher's Status:   Active

1. Introduction and History Part I: The Crossing Number 2. Crossing Number 3. Crossing Number and other Parameters 4. Computational Complexity 5. Algorithms Part II: Crossing Number Variants 6. Rectilinear Crossing Number 7. Local Crossing Number 8. Monotone and Book crossing numbers 9. Pair Crossing Number 10. k-planar Crossing Number 11. Independent Odd Crossing Number 12. Maximum Crossing Numbers Part III: Applications 13. Crossing Minimization 14. Geometric Configurations Appendix A Topological Graph Theory Basics B Complexity Theory

Marcus Schaefer received his undergraduate degree from the University of Karlsruhe, then his Ph.D. in Computer Science from the University of Chicago. After getting his doctorate, he has worked at the Computer Science Department of DePaul University in Chicago where he became an associate professor. His research interests include graph drawing, graph theory, computational complexity, and computability. He currently has 57 publications on MathSciNet. He also co-authored a book, Algorithms.

My Shopping Basket
Your cart does not contain any items.