Crossing Numbers of Graphs. Este artículo no está disponible.
Idioma: inglés
Editorial: Taylor & Francis Inc, 2017
Serie: Libro 42 de 67 - Discrete Mathematics and Its Applications
- Tapa dura
- Nuevo

Librería: THE SAINT BOOKSTORE, Southport, Reino UnidoTHE SAINT BOOKSTORE
Vendedor de AbeBooks desde el 14 de junio de 2006
Condición: Nuevo
EUR 158,69
Descripción del artículo del vendedor
New copy - Usually dispatched within 4 working days.
N° de ref. del artículo B9781498750493
- Título
- Crossing Numbers of Graphs
- Autor
- Marcus Schaefer
- Editorial
- Taylor & Francis Inc
- Año de publicación
- 2017
- Estado
- New
- Encuadernación
- Hardback
- Idioma
- inglés
- ISBN 10
- 1498750494
- ISBN 13
- 9781498750493
- Peso del artículo
- 765 gramos
- Serie
- Libro 42 de 67: Discrete Mathematics and Its Applications
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.
The first part of the text deals with traditional crossing number, crossing number values, crossing lemma, related parameters, computational complexity, and algorithms. The second part includes the rich history of alternative crossing numbers, the rectilinear crossing number, the pair crossing number, and the independent odd crossing number.It also includes applications of the crossing number outside topological graph theory.
- Aimed at graduate students and professionals in both mathematics and computer science
- The first book of its kind devoted to the topic
- Authored by a noted authority in crossing numbers
“Sinopsis” puede pertenecer a otra edición de este título.
Acerca del autor
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.
“Acerca de” puede pertenecer a otra edición de este título.