Cantitate/Preț
Produs
Total produse
Vezi coșul
Words and Graphs de Sergey Kitaev

Words and Graphs: Monographs in Theoretical Computer Science. An EATCS Series

Autor Sergey Kitaev, Vadim Lozin
en Limba Engleză Paperback – 23 aug 2016
This is the first comprehensive introduction to the theory of word-representable graphs, a generalization of several classical classes of graphs, and a new topic in discrete mathematics.
After extensive introductory chapters that explain the context and consolidate the state of the art in this field, including a chapter on hereditary classes of graphs, the authors suggest a variety of problems and directions for further research, and they discuss interrelations of words and graphs in the literature by means other than word-representability.
The book is self-contained, and is suitable for both reference and learning, with many chapters containing exercises and solutions to seleced problems. It will be valuable for researchers and graduate and advanced undergraduate students in discrete mathematics and theoretical computer science, in particular those engaged with graph theory and combinatorics, and also for specialists in algebra. 
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 59412 lei  38-44 zile
  Springer International Publishing – 23 aug 2016 59412 lei  38-44 zile
Hardback (1) 60579 lei  38-44 zile
  Springer International Publishing – 28 noi 2015 60579 lei  38-44 zile

Din seria Monographs in Theoretical Computer Science. An EATCS Series

Preț: 59412 lei

Preț vechi: 74265 lei
-20% Nou

Puncte Express: 891
Preț estimativ în valută:
11369€ • 11958$ • 94100£

Carte tipărită la comandă

Livrare economică 04-10 ianuarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319356693
ISBN-10: 3319356690
Pagini: 264
Ilustrații: XVIII, 264 p. 137 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.4 kg
Ediția:Softcover reprint of the original 1st ed. 2015
Editura: Springer International Publishing
Colecția Springer
Seria Monographs in Theoretical Computer Science. An EATCS Series

Locul publicării:Cham, Switzerland

Cuprins

Introduction.- Hereditary Classes of Graphs.- What Word-Representable Graphs Are and Where They Come From.- Characterization of Word-Representable Graphs in Terms of Semi-transitive Orientations.- Various Results on Word-Representable Graphs.- Open Problems and Further Research Directions on Word-Representable Graphs.- Interrelations Between Words and Graphs in the Literature.- More on Interrelations Between Words and Graphs in the Literature.- App. A: Graph Theory Background.- App. B: Beyond Graph Theory Background.

Recenzii

“UK pioneers Kitaev (Univ. of Strathclyde) and Lozin (Univ. of Warwick) now provide a first monographic treatment. Advanced undergraduates (no previous background is required) will gain access to an almost brand-new research area still rife with open problems. Summing Up: Recommended. Upper-division undergraduates through professionals/practitioners.” (D. V. Feldman, Choice, Vol. 54 (1), September, 2016)

Notă biografică

Dr. Sergey Kitaev is a Reader in Combinatorics in the Department of Computer and Information Sciences of the University of Strathclyde. He studied at Novosibirsk State University, specializing in mathematical cybernetics, and received his Ph.D. from the University of Gothenburg in 2003. He has held visiting positions at the University of California, San Diego, the Sobolev Institute of Mathematics, and the Royal Swedish Academy of Sciences, and most recently he was an Associate Professor of Mathematics in Reykjavik University. He authored the (Springer) monograph "Patterns in Permutations and Words" in 2011. His research focuses on combinatorics, discrete analysis, graph theory, and formal languages.
Prof. Vadim Lozin is a Professor in the Mathematics Institute at the University of Warwick. He received his Ph.D. in theoretical informatics from the University of Nizhny Novgorod in 1995. He was a visiting professor at Rutgers University, and he has held academic and visiting positions in Russia, Sweden, Switerland, Portugal, Germany, Canada, Saudi Arabia and France. He is the Managing Editor of the (Elsevier) Electronic Notes in Discrete Mathematics, and an Associate Editor of the (Elsevier) journal Discrete Applied Mathematics. His research focuses on graph theory, combinatorics, and discrete mathematics.

Textul de pe ultima copertă

This is the first comprehensive introduction to the theory of word-representable graphs, a generalization of several classical classes of graphs, and a new topic in discrete mathematics.
After extensive introductory chapters that explain the context and consolidate the state of the art in this field, including a chapter on hereditary classes of graphs, the authors suggest a variety of problems and directions for further research, and they discuss interrelations of words and graphs in the literature by means other than word-representability.
The book is self-contained, and is suitable for both reference and learning, with many chapters containing exercises and solutions to seleced problems. It will be valuable for researchers and graduate and advanced undergraduate students in discrete mathematics and theoretical computer science, in particular those engaged with graph theory and combinatorics, and also for specialists in algebra. 

Caracteristici

Self-contained survey, useful for learning and reference Authors among key researchers in this field Suggests problems and directions for further research