Download or read book Convexity and Graph Theory written by M. Rosenfeld and published by Elsevier. This book was released on 1984-01-01 with total page 352 pages. Available in PDF, EPUB and Kindle. Book excerpt: Among the participants discussing recent trends in their respective fields and in areas of common interest in these proceedings are such world-famous geometers as H.S.M. Coxeter, L. Danzer, D.G. Larman and J.M. Wills, and equally famous graph-theorists B. Bollobás, P. Erdös and F. Harary. In addition to new results in both geometry and graph theory, this work includes articles involving both of these two fields, for instance ``Convexity, Graph Theory and Non-Negative Matrices'', ``Weakly Saturated Graphs are Rigid'', and many more. The volume covers a broad spectrum of topics in graph theory, geometry, convexity, and combinatorics. The book closes with a number of abstracts and a collection of open problems raised during the conference.
Download or read book Geodesic Convexity in Graphs written by Ignacio M. Pelayo and published by Springer Science & Business Media. This book was released on 2013-09-06 with total page 117 pages. Available in PDF, EPUB and Kindle. Book excerpt: Geodesic Convexity in Graphs is devoted to the study of the geodesic convexity on finite, simple, connected graphs. The first chapter includes the main definitions and results on graph theory, metric graph theory and graph path convexities. The following chapters focus exclusively on the geodesic convexity, including motivation and background, specific definitions, discussion and examples, results, proofs, exercises and open problems. The main and most studied parameters involving geodesic convexity in graphs are both the geodetic and the hull number which are defined as the cardinality of minimum geodetic and hull set, respectively. This text reviews various results, obtained during the last one and a half decade, relating these two invariants and some others such as convexity number, Steiner number, geodetic iteration number, Helly number, and Caratheodory number to a wide range a contexts, including products, boundary-type vertex sets, and perfect graph families. This monograph can serve as a supplement to a half-semester graduate course in geodesic convexity but is primarily a guide for postgraduates and researchers interested in topics related to metric graph theory and graph convexity theory.
Download or read book Convexity and Discrete Geometry Including Graph Theory written by Karim Adiprasito and published by Springer. This book was released on 2016-05-02 with total page 277 pages. Available in PDF, EPUB and Kindle. Book excerpt: This volume presents easy-to-understand yet surprising properties obtained using topological, geometric and graph theoretic tools in the areas covered by the Geometry Conference that took place in Mulhouse, France from September 7–11, 2014 in honour of Tudor Zamfirescu on the occasion of his 70th anniversary. The contributions address subjects in convexity and discrete geometry, in distance geometry or with geometrical flavor in combinatorics, graph theory or non-linear analysis. Written by top experts, these papers highlight the close connections between these fields, as well as ties to other domains of geometry and their reciprocal influence. They offer an overview on recent developments in geometry and its border with discrete mathematics, and provide answers to several open questions. The volume addresses a large audience in mathematics, including researchers and graduate students interested in geometry and geometrical problems.
Download or read book An Algorithmic Theory of Numbers Graphs and Convexity written by Laszlo Lovasz and published by SIAM. This book was released on 1987-01-01 with total page 95 pages. Available in PDF, EPUB and Kindle. Book excerpt: Studies two algorithms in detail: the ellipsoid method and the simultaneous diophantine approximation method.
Download or read book Convexity in Discrete Structures written by Manoj Changat and published by . This book was released on 2010 with total page 142 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book A Course in Convexity written by Alexander Barvinok and published by American Mathematical Soc.. This book was released on 2002-11-19 with total page 378 pages. Available in PDF, EPUB and Kindle. Book excerpt: Convexity is a simple idea that manifests itself in a surprising variety of places. This fertile field has an immensely rich structure and numerous applications. Barvinok demonstrates that simplicity, intuitive appeal, and the universality of applications make teaching (and learning) convexity a gratifying experience. The book will benefit both teacher and student: It is easy to understand, entertaining to the reader, and includes many exercises that vary in degree of difficulty. Overall, the author demonstrates the power of a few simple unifying principles in a variety of pure and applied problems. The prerequisites are minimal amounts of linear algebra, analysis, and elementary topology, plus basic computational skills. Portions of the book could be used by advanced undergraduates. As a whole, it is designed for graduate students interested in mathematical methods, computer science, electrical engineering, and operations research. The book will also be of interest to research mathematicians, who will find some results that are recent, some that are new, and many known results that are discussed from a new perspective.
Download or read book Combinatorial Convexity written by Imre Bárány and published by American Mathematical Soc.. This book was released on 2021-11-04 with total page 148 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book is about the combinatorial properties of convex sets, families of convex sets in finite dimensional Euclidean spaces, and finite points sets related to convexity. This area is classic, with theorems of Helly, Carathéodory, and Radon that go back more than a hundred years. At the same time, it is a modern and active field of research with recent results like Tverberg's theorem, the colourful versions of Helly and Carathéodory, and the (p,q) (p,q) theorem of Alon and Kleitman. As the title indicates, the topic is convexity and geometry, and is close to discrete mathematics. The questions considered are frequently of a combinatorial nature, and the proofs use ideas from geometry and are often combined with graph and hypergraph theory. The book is intended for students (graduate and undergraduate alike), but postdocs and research mathematicians will also find it useful. It can be used as a textbook with short chapters, each suitable for a one- or two-hour lecture. Not much background is needed: basic linear algebra and elements of (hyper)graph theory as well as some mathematical maturity should suffice.
Download or read book Convexity in Discrete Structures written by Manoj Changat and published by . This book was released on 2008 with total page 143 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Convexity in Graphs written by John L. Pfaltz and published by . This book was released on 1968 with total page 116 pages. Available in PDF, EPUB and Kindle. Book excerpt: A natural concept of convexity for directed graphs is introduced, and properties of the lattice of convex subgraphs of a graph are studied. The extent to which this lattice determines the graph is established, and conditions for a lattice to be a convex subgraph lattice are investigated. The concept of a lower semi-homomorphism is defined for lattices; it is shown that such mappings preserve basic properties of convex subgraph lattices, and that on such lattices, they are uniquely determined by their kernels. Graph homomorphisms which preserve convexity are also studied, with emphasis on their relationship to lower semi-homomorphisms of the convex subgraph lattice. Homomorphisms which 'contract' subgraphs (which are analogous to the rewriting rules of context-sensitive phrase structure grammars) are briefly considered. Finally, a concept of local convexity for directed graphs is introduced. (Author).
Download or read book Combinatorial Convexity written by Imre Bárány and published by American Mathematical Soc.. This book was released on 2021-11-04 with total page 148 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book is about the combinatorial properties of convex sets, families of convex sets in finite dimensional Euclidean spaces, and finite points sets related to convexity. This area is classic, with theorems of Helly, Carathéodory, and Radon that go back more than a hundred years. At the same time, it is a modern and active field of research with recent results like Tverberg's theorem, the colourful versions of Helly and Carathéodory, and the (p,q) (p,q) theorem of Alon and Kleitman. As the title indicates, the topic is convexity and geometry, and is close to discrete mathematics. The questions considered are frequently of a combinatorial nature, and the proofs use ideas from geometry and are often combined with graph and hypergraph theory. The book is intended for students (graduate and undergraduate alike), but postdocs and research mathematicians will also find it useful. It can be used as a textbook with short chapters, each suitable for a one- or two-hour lecture. Not much background is needed: basic linear algebra and elements of (hyper)graph theory as well as some mathematical maturity should suffice.
Download or read book Topics in Graph Theory written by Wilfried Imrich and published by CRC Press. This book was released on 2008-10-27 with total page 219 pages. Available in PDF, EPUB and Kindle. Book excerpt: From specialists in the field, you will learn about interesting connections and recent developments in the field of graph theory by looking in particular at Cartesian products-arguably the most important of the four standard graph products. Many new results in this area appear for the first time in print in this book. Written in an accessible way,
Download or read book The Interval Function of a Graph written by H. M. Mulder and published by . This book was released on 1980 with total page 224 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book 1981 International Conference on Convexity and Graph Theory written by and published by . This book was released on 1981 with total page 55 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Algorithms for Convex Optimization written by Nisheeth K. Vishnoi and published by Cambridge University Press. This book was released on 2021-10-07 with total page 314 pages. Available in PDF, EPUB and Kindle. Book excerpt: In the last few years, Algorithms for Convex Optimization have revolutionized algorithm design, both for discrete and continuous optimization problems. For problems like maximum flow, maximum matching, and submodular function minimization, the fastest algorithms involve essential methods such as gradient descent, mirror descent, interior point methods, and ellipsoid methods. The goal of this self-contained book is to enable researchers and professionals in computer science, data science, and machine learning to gain an in-depth understanding of these algorithms. The text emphasizes how to derive key algorithms for convex optimization from first principles and how to establish precise running time bounds. This modern text explains the success of these algorithms in problems of discrete optimization, as well as how these methods have significantly pushed the state of the art of convex optimization itself.
Download or read book Graph Coloring and Graph Convexity written by Julio Araujo and published by . This book was released on 2012 with total page 196 pages. Available in PDF, EPUB and Kindle. Book excerpt: In this thesis, we study several problems of Graph Theory concerning Graph Coloring and Graph Convexity. Most of the results contained here are related to the computational complexity of these problems for particular graph classes. In the first and main part of this thesis, we deal with Graph Coloring which is one of the most studied areas of Graph Theory. We first consider three graph coloring problems called Greedy Coloring, Weighted Coloring and Weighted Improper Coloring. Then, we deal with a decision problem, called Good Edge-Labelling, whose definition was motivated by the Wavelength Assignment problem in optical networks. The second part of this thesis is devoted to a graph optimization parameter called (geodetic) hull number. The definition of this parameter is motivated by an extension to graphs of the notions of convex sets and convex hulls in the Euclidean space. Finally, we present in the appendix other works developed during this thesis, one about Eulerian and Hamiltonian directed hypergraphs and the other concerning distributed storage systems.
Download or read book Discrete Convex Analysis written by Kazuo Murota and published by SIAM. This book was released on 2003-01-01 with total page 411 pages. Available in PDF, EPUB and Kindle. Book excerpt: Discrete Convex Analysis is a novel paradigm for discrete optimization that combines the ideas in continuous optimization (convex analysis) and combinatorial optimization (matroid/submodular function theory) to establish a unified theoretical framework for nonlinear discrete optimization. The study of this theory is expanding with the development of efficient algorithms and applications to a number of diverse disciplines like matrix theory, operations research, and economics. This self-contained book is designed to provide a novel insight into optimization on discrete structures and should reveal unexpected links among different disciplines. It is the first and only English-language monograph on the theory and applications of discrete convex analysis.
Download or read book Theory of Convex Structures written by M.L.J. van de Vel and published by Elsevier. This book was released on 1993-08-02 with total page 556 pages. Available in PDF, EPUB and Kindle. Book excerpt: Presented in this monograph is the current state-of-the-art in the theory of convex structures. The notion of convexity covered here is considerably broader than the classic one; specifically, it is not restricted to the context of vector spaces. Classical concepts of order-convex sets (Birkhoff) and of geodesically convex sets (Menger) are directly inspired by intuition; they go back to the first half of this century. An axiomatic approach started to develop in the early Fifties. The author became attracted to it in the mid-Seventies, resulting in the present volume, in which graphs appear side-by-side with Banach spaces, classical geometry with matroids, and ordered sets with metric spaces. A wide variety of results has been included (ranging for instance from the area of partition calculus to that of continuous selection). The tools involved are borrowed from areas ranging from discrete mathematics to infinite-dimensional topology. Although addressed primarily to the researcher, parts of this monograph can be used as a basis for a well-balanced, one-semester graduate course.
