Listing 1 - 10 of 52 | << page >> |
Sort by
|
Choose an application
The theory of random graphs began in the late 1950s in several papers by Erdos and Renyi. In the late twentieth century, the notion of six degrees of separation, meaning that any two people on the planet can be connected by a short chain of people who know each other, inspired Strogatz and Watts to define the small world random graph in which each site is connected to k close neighbors, but also has long-range connections. At a similar time, it was observed in human social and sexual networks and on the Internet that the number of neighbors of an individual or computer has a power law distribution. This inspired Barabasi and Albert to define the preferential attachment model, which has these properties. These two papers have led to an explosion of research. The purpose of this book is to use a wide variety of mathematical argument to obtain insights into the properties of these graphs. A unique feature is the interest in the dynamics of process taking place on the graph in addition to their geometric properties, such as connectedness and diameter.
Random graphs --- Graphes aléatoires --- Graphes aléatoires --- Discrete mathematics --- Random graphs. --- Graphs, Random --- Graph theory
Choose an application
Speaking of Dance: Twelve Contemporary Choreographers on Their Craft delves into the choreographic processes of some of America's most engaging and revolutionary dancemakers. Based on personal interviews, the book's narratives reveal the methods and quests of, among others, Merce Cunningham, Meredith Monk, Bill T. Jones, Trisha Brown, and Mark Morris. Morgenroth shows how the ideas, craft, and passion that go into their work have led these choreographers to disrupt known forms and expectations. The history of dance in the making is revealed through the stories of these int
Choreography. --- Choreographers --- Chorégraphie --- Chorégraphes --- Biography --- Biographies --- Dance
Choose an application
Graph Theory
Graph theory --- Combinatorial analysis --- Théorie des graphes --- Congresses --- Congrès --- ELSEVIER-B EPUB-LIV-FT --- Graphes. (Congrès) --- Grafen (Congres) --- Graph theory - Congresses
Choose an application
Collected in this volume are most of the important theorems and algorithms currently known for planar graphs, together with constructive proofs for the theorems. Many of the algorithms are written in Pidgin PASCAL, and are the best-known ones; the complexities are linear or 0(nlogn). The first two chapters provide the foundations of graph theoretic notions and algorithmic techniques. The remaining chapters discuss the topics of planarity testing, embedding, drawing, vertex- or edge-coloring, maximum independence set, subgraph listing, planar separator theorem, Hamiltonian cycles, and s
Discrete mathematics --- Graphes, Théorie des --- Graphes planaires --- Graph theory --- Graph theory. --- Algorithms. --- Algorithms --- Algorism --- Algebra --- Arithmetic --- Graphs, Theory of --- Theory of graphs --- Combinatorial analysis --- Topology --- Foundations --- Extremal problems
Choose an application
Combinatorial analysis --- Graph theory --- Analyse combinatoire --- Graphes, Théorie des --- Cliques (Théorie des graphes) --- Graphs, Theory of --- Theory of graphs --- Extremal problems --- Topology
Choose an application
Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems. It remains a stepping stone from which the reader may embark on one of many fascinating research trails.The past twenty years have been an amazingly fruitful period of research in algorithmic graph theory and structured families of graphs. Especially important have been the theory and applications of new intersectio
Perfect graphs. --- Graph theory --- Perfect graphs --- Graphes parfaits --- ELSEVIER-B EPUB-LIV-FT
Choose an application
Graph theory in modern engineering; computer aided design, control, optimization, reliability analysis
Graph theory. --- Electrical engineering --- Graphic methods. --- Graph theory --- Graphs, Theory of --- Theory of graphs --- Extremal problems --- Combinatorial analysis --- Topology --- Computer-aided design --- Théorie des graphes --- Conception assistée par ordinateur --- ELSEVIER-B EPUB-LIV-FT --- Graphes, Théorie des
Choose an application
Mathematics --- Graph theory --- Théorie des graphes --- Periodicals. --- Périodiques --- Periodicals --- Graphes, Théorie des --- JEX9 --- Business, Economy and Management --- Mathematical Sciences --- General and Others --- Applied Mathematics --- Graphs, Theory of --- Theory of graphs --- Extremal problems --- Combinatorial analysis --- Topology
Choose an application
This standard textbook of modern graph theory, now in its fifth edition, combines the authority of a classic with the engaging freshness of style that is the hallmark of active mathematics. It covers the core material of the subject with concise yet reliably complete proofs, while offering glimpses of more advanced methods in each field by one or two deeper results, again with proofs given in full detail. The book can be used as a reliable text for an introductory course, as a graduate text, and for self-study. [Back cover]
Graph theory --- Graphes, Théorie des --- Grafos, Teoría de --- Combinatorics. --- Computer science. --- Math Applications in Computer Science. --- Graphes, Théorie des. --- Informatics --- Science --- Combinatorics --- Algebra --- Mathematical analysis --- Graphentheorie. --- Computer science—Mathematics. --- Discrete mathematics. --- Computer science --- Discrete Mathematics. --- Mathematical Applications in Computer Science. --- Mathematics. --- Computer mathematics --- Electronic data processing --- Mathematics --- Discrete mathematical structures --- Mathematical structures, Discrete --- Structures, Discrete mathematical --- Numerical analysis --- Graphes, Théorie des.
Choose an application
Linear and combinatorial optimization in ordered algebraic structures
Discrete mathematics --- Ordered algebraic structures. --- Combinatorial optimization. --- Optimization, Combinatorial --- Combinatorial analysis --- Mathematical optimization --- Algebraic structures, Ordered --- Structures, Ordered algebraic --- Algebra --- Graphes, Théorie des --- Programmation (mathématiques) --- Structures algébriques ordonnées
Listing 1 - 10 of 52 | << page >> |
Sort by
|