Editors:
- Fast track conference proceeding
- Unique visibility
- State of the art research
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 6078)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Conference series link(s): CIAC: International Conference on Algorithms and Complexity
Conference proceedings info: CIAC 2010.
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (33 papers)
-
Front Matter
-
Session 1. Graph Algorithms I
-
Session 2. Computational Complexity
-
Session 3. Graph Coloring
Keywords
- algorithms
- approximation
- combinatorial optimization
- combinatorics
- complexity
- computational complexity
- computational geometry
- computational graph theory
- game theory
- geometric algorithms
- graph algorithms
- graph coloring
- graph computations
- networ
- algorithm analysis and problem complexity
- data structures
Editors and Affiliations
-
Department of Computer Science, Sapienza University of Rome, Rome, Italy
Tiziana Calamoneri
-
Departament de Llenguatges i Sistemes Informatics, Universitat Politecnica de Catalunya, Barcelona, Spain
Josep Diaz
Bibliographic Information
Book Title: Algorithms and Complexity
Book Subtitle: 7th International Conference, CIAC 2010, Rome, Italy, May 26-28, 2010, Proceedings
Editors: Tiziana Calamoneri, Josep Diaz
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-642-13073-1
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Vralg Berlin Heidelberg 2010
Softcover ISBN: 978-3-642-13072-4Published: 20 May 2010
eBook ISBN: 978-3-642-13073-1Published: 11 May 2010
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XI, 384
Topics: Programming Techniques, Computer Communication Networks, Theory of Computation, Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science, Data Structures