WALCOM: Algorithms and Computation (eBook)

4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010, Proceedings

Md. Saidur Rahman, Satoshi Fujita (Herausgeber)

eBook Download: PDF

2010 | 2010
XIII, 305 Seiten
Springer Berlin (Verlag)
978-3-642-11440-3 (ISBN)

Inhalt

Invited Talks.- Crossings between Curves with Many Tangencies.- Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon.- Approximation Algorithms for Art Gallery Problems in Polygons and Terrains.- The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing.- Graph Drawing.- Small Grid Drawings of Planar Graphs with Balanced Bipartition.- Switch-Regular Upward Planar Embeddings of Trees.- A Global k-Level Crossing Reduction Algorithm.- Computational Geometry.- Computation of Non-dominated Points Using Compact Voronoi Diagrams.- Cutting a Convex Polyhedron Out of a Sphere.- A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motion.- Graph Algorithms I.- Acyclically 3-Colorable Planar Graphs.- Reconstruction Algorithm for Permutation Graphs.- Harmonious Coloring on Subclasses of Colinear Graphs.- Computational Biology and Strings.- Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions.- The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time.- Parallel Algorithms for Encoding and Decoding Blob Code.- Combinatorial Optimization.- A Rooted-Forest Partition with Uniform Vertex Demand.- A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique.- Graph Algorithms II.- On Some Simple Widths.- A New Model for a Scale-Free Hierarchical Structure of Isolated Cliques.- Approximation Algorithms.- The Covert Set-Cover Problem with Application to Network Discovery.- Variants of Spreading Messages.- On Finding a Better Position of a Convex Polygon Inside a Circle to Minimize the Cutting Cost.- Real Root Isolation of Multi-Exponential Polynomials with Application.- Parameterized Complexity.- FPT Algorithms for Connected Feedback Vertex Set.- A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs.- Pathwidth and Searching in Parameterized Threshold Graphs.

Produkt-Details

• Erscheint lt. Verlag: 3.2.2010
• Reihe/Serie: Lecture Notes in Computer Science
• Reihe/Serie: Theoretical Computer Science and General Issues
• Verlagsort: Berlin
• Sprache: englisch
• Themenwelt: Mathematik / Informatik ► Informatik
• Schlagworte: algorithms • Approximation • Ban • combinatorial optimization • Complexity • Computational Geometry • Computational Graph Theory • Computer Algebra • FPT • Graph • graph coloring • graph search • graph theory • Optimization • Parallel Algorithms • Planar Graphs • planarity • polygons • shortest path • Symbolic Computing • Voronoi diagrapms
• ISBN-10: 3-642-11440-7 / 3642114407
• ISBN-13: 978-3-642-11440-3 / 9783642114403