๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

[Lecture Notes in Computer Science] Computing and Combinatorics Volume 6842 || Computing the Girth of a Planar Graph in Linear Time

โœ Scribed by Fu, Bin; Du, Ding-Zhu

Book ID
120434494
Publisher
Springer Berlin Heidelberg
Year
2011
Tongue
English
Weight
246 KB
Edition
1
Category
Article
ISBN
364222685X

No coin nor oath required. For personal study only.

โœฆ Synopsis

This book constitutes the refereed proceedings of the 17th Annual International Conference on Computing and Combinatorics, held in Dallas, TX, USA, in August 2011. The 54 revised full papers presented were carefully reviewed and selected from 136 submissions. Topics covered are algorithms and data structures; algorithmic game theory and online algorithms; automata, languages, logic, and computability; combinatorics related to algorithms and complexity; complexity theory; computational learning theory and knowledge discovery; cryptography, reliability and security, and database theory; computational biology and bioinformatics; computational algebra, geometry, and number theory; graph drawing and information visualization; graph theory, communication networks, and optimization; parallel and distributed computing.

๐Ÿ“œ SIMILAR VOLUMES

[Lecture Notes in Computer Science] Comp
[Lecture Notes in Computer Science] Computing and Combinatorics Volume 6842 || A New Variation of Hat Guessing Games
โœ Fu, Bin; Du, Ding-Zhu ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Springer Berlin Heidelberg ๐ŸŒ English โš– 216 KB

This book constitutes the refereed proceedings of the 17th Annual International Conference on Computing and Combinatorics, held in Dallas, TX, USA, in August 2011. The 54 revised full papers presented were carefully reviewed and selected from 136 submissions. Topics covered are algorithms and data s

[Lecture Notes in Computer Science] Comp
[Lecture Notes in Computer Science] Computing and Combinatorics Volume 4112 || Computing Maximum-Scoring Segments in Almost Linear Time
โœ Chen, Danny Z.; Lee, D. T. ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Springer Berlin Heidelberg ๐ŸŒ German โš– 362 KB

This Book Presents The Refereed Proceedings Of The 12th Annual International Computing And Combinatorics Conference, Cocoon 2006, Held In Taipei, Taiwan, August 2006. The Book Offers 52 Revised Full Papers Presented Together With Abstracts Of 2 Invited Talks. The Papers Are Organized In Topical Sect

[Lecture Notes in Computer Science] Comp
[Lecture Notes in Computer Science] Computing and Combinatorics Volume 4112 || Computing Maximum-Scoring Segments in Almost Linear Time
โœ Chen, Danny Z.; Lee, D. T. ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Springer Berlin Heidelberg ๐ŸŒ German โš– 362 KB

This Book Presents The Refereed Proceedings Of The 12th Annual International Computing And Combinatorics Conference, Cocoon 2006, Held In Taipei, Taiwan, August 2006. The Book Offers 52 Revised Full Papers Presented Together With Abstracts Of 2 Invited Talks. The Papers Are Organized In Topical Sect

[Lecture Notes in Computer Science] Comp
[Lecture Notes in Computer Science] Computing and Combinatorics Volume 6842 || Task Ordering and Memory Management Problem for Degree of Parallelism Estimation
โœ Fu, Bin; Du, Ding-Zhu ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Springer Berlin Heidelberg ๐ŸŒ English โš– 284 KB

This book constitutes the refereed proceedings of the 17th Annual International Conference on Computing and Combinatorics, held in Dallas, TX, USA, in August 2011. The 54 revised full papers presented were carefully reviewed and selected from 136 submissions. Topics covered are algorithms and data s