You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Given points in the plane, connect them using minimum ink. Though the task seems simple, it turns out to be very time consuming. In fact, scientists believe that computers cannot efficiently solve it. So, do we have to resign? This book examines such NP-hard network-design problems, from connectivity problems in graphs to polygonal drawing problems on the plane. First, we observe why it is so hard to optimally solve these problems. Then, we go over to attack them anyway. We develop fast algorithms that find approximate solutions that are very close to the optimal ones. Hence, connecting points with slightly more ink is not hard.
This book constitutes the proceedings of the 10th Latin American Symposium on Theoretical Informatics, LATIN 2012, held in Arequipa, Peru, in April 2012. The 55 papers presented in this volume were carefully reviewed and selected from 153 submissions. The papers address a variety of topics in theoretical computer science with a certain focus on algorithms, automata theory and formal languages, coding theory and data compression, algorithmic graph theory and combinatorics, complexity theory, computational algebra, computational biology, computational geometry, computational number theory, cryptography, theoretical aspects of databases and information retrieval, data structures, networks, logic in computer science, machine learning, mathematical programming, parallel and distributed computing, pattern matching, quantum computing and random structures.
This book constitutes revised selected papers from the 25th International Symposium on Graph Drawing and Network Visualization, GD 2017, held in Boston, MA, USA, in September 2017.The 34 full and 9 short papers presented in this volume were carefully reviewed and selected from 87 submissions. Also included in this book are 2 abstracts of keynote presentations, 16 poster abstracts, and 1 contest report. The papers are organized in topical sections named: straight-line representations; obstacles and visibility; topological graph theory; orthogonal representations and book embeddings; evaluations; tree drawings; graph layout designs; point-set embeddings; special representations; and beyond planarity.
This book constitutes the refereed proceedings of the 6th International Conference on Simulated Evolution and Learning, SEAL 2006, held in Hefei, China in October 2006. The 117 revised full papers presented were carefully reviewed and selected from 420 submissions.
This book constitutes revised selected papers from the 24th International Symposium on Graph Drawing and Network Visualization, GD 2016, held in Athens, Greece, in September 2016. The 45 papers presented in this volume were carefully reviewed and selected from 99 submissions. They were organized in topical sections named: large graphs and clutter avoidance; clustered graphs; planar graphs, layered and tree drawings; visibility representations; beyond planarity; crossing minimization and crossing numbers; topological graph theory; special graph embeddings; dynamic graphs, contest report.
The volume includes a set of selected papers extended and revised from the International Conference on Teaching and Computational Science (WTCS 2009) held on December 19- 20, 2009, Shenzhen, China. WTCS 2009 best papers Volume 2 is to provide a forum for researchers, educators, engineers, and government officials involved in the general areas of Education, Psychology and Computer Science to disseminate their latest research results and exchange views on the future research directions of these fields. 128 high-quality papers are included in the volume. Each paper has been peer-reviewed by at least 2 program committee members and selected by the volume editor Prof. Wu. On behalf of the WTCS 2009, we would like to express our sincere appreciation to all of authors and referees for their efforts reviewing the papers. Hoping you can find lots of profound research ideas and results on the related fields of Education, Psychology and Computer Science.
This book constitutes the refereed proceedings of the 15th Algorithms and Data Structures Symposium, WADS 2017, held in St. John's, NL, Canada, in July/August 2017. The 49 full papers presented together with 3 abstracts of invited talks were carefully reviewed and selected from 109 submissions. They present original research on the theory and application of algorithms and data structures in many areas, including combinatorics, computational geometry, databases, graphics, and parallel and distributed computing. The WADS Symposium, which alternates with the Scandinavian Symposium and Workshops on Algorithm Theory, SWAT, is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. Papers presenting original research on the theory and application of algorithms and data structures
The abundance of information and increase in computing power currently enable researchers to tackle highly complicated and challenging computational problems. Solutions to such problems are now feasible using advances and innovations from the area of Artificial Intelligence. The general focus of the AIAI conference is to provide insights on how Artificial Intelligence may be applied in real-world situations and serve the study, analysis and modeling of theoretical and practical issues. This volume contains papers selected for presentation at the 6th IFIP Conference on Artificial Intelligence Applications and Innovations (AIAI 2010) and held in Larnaca, Cyprus, during October 6–7, 2010. IFI...
This book constitutes the revised papers of the 46th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2020, held in Leeds, UK, in June 2020. The workshop was held virtually due to the COVID-19 pandemic. The 32 full papers presented in this volume were carefully reviewed and selected from 94 submissions. They cover a wide range of areas, aiming to present emerging research results and to identify and explore directions of future research of concepts on graph theory and how they can be applied to various areas in computer science.
Constraining graph layouts - that is, restricting the placement of vertices and the routing of edges to obey certain constraints - is common practice in graph drawing. In this book, we discuss algorithmic results on two different restriction types: placing vertices on the outer face and on the integer grid. For the first type, we look into the outer k-planar and outer k-quasi-planar graphs, as well as giving a linear-time algorithm to recognize full and closed outer k-planar graphs Monadic Second-order Logic. For the second type, we consider the problem of transferring a given planar drawing onto the integer grid while perserving the original drawings topology; we also generalize a variant of Cauchy's rigidity theorem for orthogonal polyhedra of genus 0 to those of arbitrary genus.