Narrow your search

Library

AP (2)

KDG (2)

KU Leuven (2)

Odisee (2)

Thomas More Kempen (2)

Thomas More Mechelen (2)

UCLL (2)

ULB (2)

ULiège (2)

VIVES (2)


Resource type

book (2)

digital (2)


Language

English (4)


Year
From To Submit

2013 (4)

Listing 1 - 4 of 4
Sort by

Book
Graph-Theoretic Concepts in Computer Science : 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers
Authors: --- ---
ISBN: 3642450423 3642450431 Year: 2013 Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book constitutes the thoroughly refereed proceedings of the 39th International Workshop on Graph Theoretic Concepts in Computer Science, WG 2013, held in Lübeck, Germany, in June 2013. The 34 revised full papers presented were carefully reviewed and selected from 61 submissions. The book also includes two abstracts. The papers cover a wide range of topics in graph theory related to computer science, such as structural graph theory with algorithmic or complexity applications; design and analysis of sequential, parallel, randomized, parameterized and distributed graph and network algorithms; computational complexity of graph and network problems; computational geometry; graph grammars, graph rewriting systems and graph modeling; graph drawing and layouts; random graphs and models of the web and scale-free networks; and support of these concepts by suitable implementations and applications.


Digital
Graph-Theoretic Concepts in Computer Science : 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers
Authors: --- ---
ISBN: 9783642450433 Year: 2013 Publisher: Berlin, Heidelberg Springer

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book constitutes the thoroughly refereed proceedings of the 39th International Workshop on Graph Theoretic Concepts in Computer Science, WG 2013, held in Lübeck, Germany, in June 2013. The 34 revised full papers presented were carefully reviewed and selected from 61 submissions. The book also includes two abstracts. The papers cover a wide range of topics in graph theory related to computer science, such as structural graph theory with algorithmic or complexity applications; design and analysis of sequential, parallel, randomized, parameterized and distributed graph and network algorithms; computational complexity of graph and network problems; computational geometry; graph grammars, graph rewriting systems and graph modeling; graph drawing and layouts; random graphs and models of the web and scale-free networks; and support of these concepts by suitable implementations and applications.


Book
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013, Proceedings
Authors: --- --- ---
ISBN: 3642403271 364240328X Year: 2013 Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book constitutes the proceedings of the 16th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2013, and the 17th International Workshop on Randomization and Computation, RANDOM 2013, held in August 2013 in the USA. The total of 48 carefully reviewed and selected papers presented in this volume consist of 23 APPROX papers selected out of 46 submissions, and 25 RANDOM papers selected out of 52 submissions. APPROX 2013 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems, while RANDOM 2013 focuses on applications of randomness to computational and combinatorial problems.

Keywords

Engineering & Applied Sciences --- Computer Science --- Computer science. --- Data structures (Computer science). --- Computers. --- Algorithms. --- Numerical analysis. --- Computer science --- Mathematical statistics. --- Computer Science. --- Algorithm Analysis and Problem Complexity. --- Discrete Mathematics in Computer Science. --- Computation by Abstract Devices. --- Numeric Computing. --- Probability and Statistics in Computer Science. --- Data Structures. --- Mathematics. --- Statistical methods --- Informatics --- Science --- Computer software. --- Computational complexity. --- Electronic data processing. --- Data structures (Computer scienc. --- Data structures (Computer science) --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- Electronic data processing --- File organization (Computer science) --- Abstract data types (Computer science) --- ADP (Data processing) --- Automatic data processing --- Data processing --- EDP (Data processing) --- IDP (Data processing) --- Integrated data processing --- Computers --- Office practice --- Complexity, Computational --- Machine theory --- Software, Computer --- Computer systems --- Automation --- Computer science—Mathematics. --- Mathematics --- Statistical inference --- Statistics, Mathematical --- Statistics --- Probabilities --- Sampling (Statistics) --- Mathematical analysis --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Cybernetics --- Calculators --- Cyberspace --- Algorism --- Algebra --- Arithmetic --- Foundations --- Discrete mathematics. --- Artificial intelligence—Data processing. --- Theory of Computation. --- Numerical Analysis. --- Data Science. --- Discrete mathematical structures --- Mathematical structures, Discrete --- Structures, Discrete mathematical --- Numerical analysis


Digital
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013. Proceedings
Authors: --- --- ---
ISBN: 9783642403286 Year: 2013 Publisher: Berlin, Heidelberg Springer

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book constitutes the proceedings of the 16th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2013, and the 17th International Workshop on Randomization and Computation, RANDOM 2013, held in August 2013 in the USA. The total of 48 carefully reviewed and selected papers presented in this volume consist of 23 APPROX papers selected out of 46 submissions, and 25 RANDOM papers selected out of 52 submissions. APPROX 2013 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems, while RANDOM 2013 focuses on applications of randomness to computational and combinatorial problems.

Listing 1 - 4 of 4
Sort by