Welcome to our book review site go-pdf.online!

You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.

Sign up

Graphs, Morphisms and Statistical Physics
  • Language: en
  • Pages: 218

Graphs, Morphisms and Statistical Physics

Based on a March 2001 workshop, this collection explores connections between random graphs and percolation, between slow mixing and phase transition, and between graph morphisms and hard-constraint models. Topics of the 14 papers include efficient local search near phase transitions in combinatorial optimization, graph homomorphisms and long range action, recent results on parameterized H-colorings, the satisfiability of random k-Horn formulae, a discrete non-Pfaffian approach to the Ising problem, and chromatic numbers of products of tournaments. No indexes are provided. Annotation : 2004 Book News, Inc., Portland, OR (booknews.com).

Physics and Theoretical Computer Science
  • Language: en
  • Pages: 349

Physics and Theoretical Computer Science

  • Type: Book
  • -
  • Published: 2007
  • -
  • Publisher: IOS Press

Aims to reinforce the interface between physical sciences, theoretical computer science, and discrete mathematics. This book assembles theoretical physicists and specialists of theoretical informatics and discrete mathematics in order to learn about developments in cryptography, algorithmics, and more.

Theoretical Aspects of Computer Science
  • Language: en
  • Pages: 230

Theoretical Aspects of Computer Science

  • Type: Book
  • -
  • Published: 2003-07-31
  • -
  • Publisher: Springer

This book presents the revised final versions of eight lectures given by leading researchers at the First Summer School on Theoretical Aspects of Computer Science in Tehran, Iran, in July 2000. The lectures presented are devoted to quantum computation, approximation algorithms, self-testing/correction, algebraic modeling of data, the regularity lemma, multiple access communication and combinatorial designs, graph-theoretical methods in computer vision, and low-density parity-check codes.

The Seventh European Conference on Combinatorics, Graph Theory and Applications
  • Language: en
  • Pages: 612

The Seventh European Conference on Combinatorics, Graph Theory and Applications

In the tradition of EuroComb'01 (Barcelona), Eurocomb'03 (Prague), EuroComb'05 (Berlin), Eurocomb'07 (Seville), Eurocomb'09 (Bordeaux), and Eurocomb'11 (Budapest), this volume covers recent advances in combinatorics and graph theory including applications in other areas of mathematics, computer science and engineering. Topics include, but are not limited to: Algebraic combinatorics, combinatorial geometry, combinatorial number theory, combinatorial optimization, designs and configurations, enumerative combinatorics, extremal combinatorics, ordered sets, random methods, topological combinatorics.

Mathematical Foundations of Computer Science 2007
  • Language: en
  • Pages: 779

Mathematical Foundations of Computer Science 2007

  • Type: Book
  • -
  • Published: 2007-08-15
  • -
  • Publisher: Springer

This book constitutes the refereed proceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2007, held in Ceský Krumlov, Czech Republic, August 2007. The 61 revised full papers presented together with the full papers or abstracts of five invited talks address all current aspects in theoretical computer science and its mathematical foundations.

Graph Drawing
  • Language: en
  • Pages: 547

Graph Drawing

  • Type: Book
  • -
  • Published: 2005-02-10
  • -
  • Publisher: Springer

This book constitutes the thoroughly refereed post-proceedings of the 12th International Symposium on Graph Drawing, GD 2004, held in New York, NY, USA in September/October 2004. The 39 revised full papers and 12 revised short papers presented together with 4 posters and a report on the graph drawing context were carefully selected during two rounds of reviewing and improvement. All current aspects in graph drawing are addressed ranging from foundational and methodological issues to applications for various classes of graphs in a variety of fields.

Algorithms and Computation
  • Language: en
  • Pages: 592

Algorithms and Computation

This book constitutes the refereed proceedings of the 11th International Conference on Algorithms and Computation, ISAAC 2000, held in Taipei, Taiwan in December 2000. The 46 revised papers presented together with an invited paper were carefully reviewed and selected from 87 submissions. The papers are organized in topical sections on algorithms and data structures; combinatorial optimization; approximation and randomized algorithms; graph drawing and graph algorithms; automata, cryptography, and complexity theory; parallel and distributed algorithms; computational geometry; and computational biology.

Integer Programming and Combinatorial Optimization
  • Language: en
  • Pages: 463

Integer Programming and Combinatorial Optimization

  • Type: Book
  • -
  • Published: 2007-03-05
  • -
  • Publisher: Springer

This book constitutes the refereed proceedings of the 7th International Conference on Integer Programming and Combinatorial Optimization, IPCO'99, held in Graz, Austria, in June 1999. The 33 revised full papers presented were carefully reviewed and selected from a total of 99 submissions. Among the topics addressed are theoretical, computational, and application-oriented aspects of approximation algorithms, branch and bound algorithms, computational biology, computational complexity, computational geometry, cutting plane algorithms, diaphantine equations, geometry of numbers, graph and network algorithms, online algorithms, polyhedral combinatorics, scheduling, and semidefinite programs.

Digraphs
  • Language: en
  • Pages: 795

Digraphs

Substantially revised, reorganised and updated, the second edition now comprises eighteen chapters, carefully arranged in a straightforward and logical manner, with many new results and open problems. As well as covering the theoretical aspects of the subject, with detailed proofs of many important results, the authors present a number of algorithms, and whole chapters are devoted to topics such as branchings, feedback arc and vertex sets, connectivity augmentations, sparse subdigraphs with prescribed connectivity, and also packing, covering and decompositions of digraphs. Throughout the book, there is a strong focus on applications which include quantum mechanics, bioinformatics, embedded computing, and the travelling salesman problem. Detailed indices and topic-oriented chapters ease navigation, and more than 650 exercises, 170 figures and 150 open problems are included to help immerse the reader in all aspects of the subject.