[Lecture Notes in Computer Science] Combinatorial Algorithms Volume 7643 || Disjoint Set Forest Digraph Representation for an Efficient Dominator Tree Construction
✍ Scribed by Arumugam, S.; Smyth, W. F.
- Book ID
- 120082049
- Publisher
- Springer Berlin Heidelberg
- Year
- 2012
- Tongue
- English
- Weight
- 315 KB
- Edition
- 1
- Category
- Article
- ISBN
- 3642359264
No coin nor oath required. For personal study only.
✦ Synopsis
This book constitutes the thoroughly referred post-workshop proceedings of the 23rd International Workshop on Combinatorial Algorithms, IWOCA 2012, held in Krishnankoil, Tamil Nadu, India, in July 2012. The 32 revised full papers presented were carefully reviewed and selected from a total of 88 submissions. The papers are organized in topical sections in algorithms and data Structures, applications (including Bioinformatics, Networking, etc.), combinatorics of words and strings, combinatorial optimization, combinatorial enumeration, decompositions and combinatorial designs, complexity theory (structural and computational), computational biology and graph theory and combinatorics submissions.