Proceedings of the Southeastern Conference on Combinatorics, Graph Theory, and Computing
Author:
Publisher:
Published: 1990
Total Pages: 1410
ISBN-13:
DOWNLOAD EBOOKRead and Download eBook Full
Author:
Publisher:
Published: 1990
Total Pages: 1410
ISBN-13:
DOWNLOAD EBOOKAuthor: Southeastern Conference on Combinatorics, Graph Theory, and Computing
Publisher:
Published: 1977
Total Pages: 704
ISBN-13:
DOWNLOAD EBOOKAuthor: K.M. Koh
Publisher: Springer
Published: 2006-11-14
Total Pages: 354
ISBN-13: 3540389245
DOWNLOAD EBOOKAuthor:
Publisher:
Published: 1984
Total Pages: 324
ISBN-13:
DOWNLOAD EBOOKAuthor: Thang N. Dinh
Publisher: Springer
Published: 2016-07-19
Total Pages: 629
ISBN-13: 3319426346
DOWNLOAD EBOOKThis book constitutes the refereed proceedings of the 22nd International Conference on Computing and Combinatorics, COCOON 2016, held in Ho Chi Minh City, Vietnam, in August 2016. The 50 revised full papers papers presented in this book were carefully reviewed and selected from various submissions. The papers cover various topics including: Theory and Algorithms; Parameterized Complexity and Algorithms; Database and Data Structures; Computational Complexity; Approximation Algorithms; Cryptography; Network and Algorithms; Graph Theory and Algorithms; Computational Geometry; Scheduling Algorithms and Circuit Complexity; Computational Geometry and Computational Biology; and Logic, Algebra and Automata.
Author: Artur Czumaj
Publisher: Cambridge University Press
Published: 2015-07-02
Total Pages: 333
ISBN-13: 1107462509
DOWNLOAD EBOOKThis book contains surveys of recent important developments in combinatorics covering a wide range of areas in the field.
Author: Ronald L. Graham
Publisher: Springer Science & Business Media
Published: 2012-12-06
Total Pages: 591
ISBN-13: 3642604064
DOWNLOAD EBOOKIn 1992, when Paul Erdos was awarded a Doctor Honoris Causa by Charles University in Prague, a small conference was held, bringing together a distin guished group of researchers with interests spanning a variety of fields related to Erdos' own work. At that gathering, the idea occurred to several of us that it might be quite appropriate at this point in Erdos' career to solicit a col lection of articles illustrating various aspects of Erdos' mathematical life and work. The response to our solicitation was immediate and overwhelming, and these volumes are the result. Regarding the organization, we found it convenient to arrange the papers into six chapters, each mirroring Erdos' holistic approach to mathematics. Our goal was not merely a (random) collection of papers but rather a thor oughly edited volume composed in large part by articles explicitly solicited to illustrate interesting aspects of Erdos and his life and work. Each chap ter includes an introduction which often presents a sample of related Erdos' problems "in his own words". All these (sometimes lengthy) introductions were written jointly by editors. We wish to thank the nearly 70 contributors for their outstanding efforts (and their patience). In particular, we are grateful to Bela Bollobas for his extensive documentation of Paul Erdos' early years and mathematical high points (in the first part of this volume); our other authors are acknowledged in their respective chapters. We also want to thank A. Bondy, G. Hahn, I.
Author: Hee-Kap Ahn
Publisher: Springer
Published: 2014-11-07
Total Pages: 769
ISBN-13: 3319130757
DOWNLOAD EBOOKThis book constitutes the refereed proceedings of the 25th International Symposium on Algorithms and Computation, ISAAC 2014, held in Jeonju, Korea, in December 2014. The 60 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 171 submissions for inclusion in the book. The focus of the volume in on the following topics: computational geometry, combinatorial optimization, graph algorithms: enumeration, matching and assignment, data structures and algorithms, fixed-parameter tractable algorithms, scheduling algorithms, computational complexity, computational complexity, approximation algorithms, graph theory and algorithms, online and approximation algorithms, and network and scheduling algorithms.
Author: Andrei M. Raigorodskii
Publisher: Springer Nature
Published: 2020-11-21
Total Pages: 499
ISBN-13: 3030558576
DOWNLOAD EBOOKAdvances in discrete mathematics are presented in this book with applications in theoretical mathematics and interdisciplinary research. Each chapter presents new methods and techniques by leading experts. Unifying interdisciplinary applications, problems, and approaches of discrete mathematics, this book connects topics in graph theory, combinatorics, number theory, cryptography, dynamical systems, finance, optimization, and game theory. Graduate students and researchers in optimization, mathematics, computer science, economics, and physics will find the wide range of interdisciplinary topics, methods, and applications covered in this book engaging and useful.