Atnaujinkite slapukų nuostatas

El. knyga: Tolerance Graphs

(Wellesley College, Massachusetts), (University of Haifa, Israel)
Kitos knygos pagal šią temą:
Tolerance GraphsDidesnis paveikslėlis
Kitos knygos pagal šią temą:

DRM apribojimai

  • Kopijuoti:

    neleidžiama

  • Spausdinti:

    neleidžiama

  • El. knygos naudojimas:

    Skaitmeninių teisių valdymas (DRM)
    Leidykla pateikė šią knygą šifruota forma, o tai reiškia, kad norint ją atrakinti ir perskaityti reikia įdiegti nemokamą programinę įrangą. Norint skaityti šią el. knygą, turite susikurti Adobe ID . Daugiau informacijos  čia. El. knygą galima atsisiųsti į 6 įrenginius (vienas vartotojas su tuo pačiu Adobe ID).

    Reikalinga programinė įranga
    Norint skaityti šią el. knygą mobiliajame įrenginyje (telefone ar planšetiniame kompiuteryje), turite įdiegti šią nemokamą programėlę: PocketBook Reader (iOS / Android)

    Norint skaityti šią el. knygą asmeniniame arba „Mac“ kompiuteryje, Jums reikalinga  Adobe Digital Editions “ (tai nemokama programa, specialiai sukurta el. knygoms. Tai nėra tas pats, kas „Adobe Reader“, kurią tikriausiai jau turite savo kompiuteryje.)

    Negalite skaityti šios el. knygos naudodami „Amazon Kindle“.

Primarily for researchers and graduate students, but also perhaps advanced undergraduate mathematics students, Golumbic (U. of Haifa) and Trenk (Wellesley College, Massachusetts) collect and survey the major results of tolerance graphs since they were introduced in 1982 by Golumbic and Monma to solve scheduling problems when resources are generally needed for exclusive use, but can be shared or relinquished when exclusive use is not possible. Chapter-end exercises are included. Annotation ©2005 Book News, Inc., Portland, OR (booknews.com)

Tolerance graphs can be used to quantify the degree to which there is conflict or accord in a system and can provide solutions to questions in the form of "optimum arrangements." Arising from the authors' teaching graduate students in the U.S. and Israel, this book is intended for use in mathematics and computer science, where the subject can be applied to algorithmics. The inclusion of many exercises with partial solutions will increase the appeal of the book to instructors as well as graduate students.

Tolerance graphs for researchers and graduate students. Collects important results and discusses applications.

Recenzijos

' great value to researchers in the field, and it can also be used as a graduate text in graph theory, since many examples and exercises have been included.' Zentralblatt MATH

Daugiau informacijos

A rigorous treatment of tolerance graphs for researchers and graduate students which collects important results and discusses applications.
1. Introduction
2. Early work on tolerance graphs
3. Trees, cotrees and bipartite graphs
4. Interval probe graphs
5. Bitolerance graphs and ordered sets
6. Unit and 50% tolerance graphs
7. Comparability and invariance results
8. Bounded bitolerance recognition
9. Algorithms on tolerance graphs
10. The hierarchy of bitolerance orders
11. Tolerance models on trees
12. Phi-tolerance models
13. Directed tolerance graphs
14. Open questions and further directions.


Daugiau apie elektronines knygas Daugiau apie elektronines knygas
Pastovi nuoroda: https://www.kriso.lt/db/97805111892962e.html
Raktažodžiai: