Benutzerdefiniertes Cover
WALCOM: Algorithms and Computation : 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings / edited by Md. Saidur Rahman, Satoshi Fujita
Mitwirkende(r): Resource type: Ressourcentyp: Buch (Online)Buch (Online)Sprache: Englisch Reihen: SpringerLink Bücher | Lecture notes in computer science ; 5942Verlag: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010Beschreibung: Online-Ressource (XIII, 305p. 72 illus, digital)ISBN:- 9783642114403
- 005.1
- 004
- 518.1 23
- 510
- 004 510
- QA76.9.A43
Inhalte:
Zusammenfassung: 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.PPN: PPN: 1649073607Package identifier: Produktsigel: ZDB-2-LNC | ZDB-2-SCS | ZDB-2-SXCS | ZDB-2-SEB
""Title Page""; ""Preface""; ""Organization""; ""Table of Contents""; ""Invited Talks""; ""Crossings between Curves with Many Tangencies""; ""Introduction""; ""Levels � Proof of Theorem 1""; ""Constructive Upper Bound � Proof of Theorem 2""; ""Concluding Remarks""; ""References""; ""Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon""; ""Introduction""; ""Finding a Simple Path on a Tree Using Eulerian Tours""; ""Shortest Paths in Polygons""; ""A Shortest-Path Algorithm Using a Dual Graph""; ""A Shortest-Path Algorithm Using Point Location""; ""Concluding Remarks""
""References""""Approximation Algorithms for Art Gallery Problems in Polygons and Terrains""; ""Problems and Results""; ""Approximation Algorithms in Polygons""; ""Approximation Algorithms on Terrains""; ""References""; ""The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing""; ""Introduction""; ""Hamiltonian Augmentations and Point-Set Embeddings""; ""Point-Set Embeddings with Mapping""; ""Point-Set Embeddings without Mapping""; ""Point-Set Embedding without Mapping: Optimal Curve Complexity and Polynomial Area""; ""Flat Division Vertices""
""Monotone Topological Book Embeddings""""Point-Set Embeddings with Curve Complexity 1""; ""Colored Hamiltonicity and Colored Point-Set Embeddability""; ""Colored Hamiltonicity""; ""Colored Point-Set Embeddings""; ""More Points Than Vertices""; ""Other Applications of Hamiltonicity to Graph Drawing""; ""Simultaneous Embeddings""; ""Radially Layered Drawings""; ""References""; ""Graph Drawing""; ""Small Grid Drawings of Planar Graphs with Balanced Bipartition""; ""Introduction""; ""Planar Graph""; ""Series-Parallel Graph""; ""Conclusions""; ""References""
""Switch-Regular Upward Planar Embeddings of Trees""""Introduction""; ""Basic Definitions""; ""3-Hooks and Red-Blue Decompositions""; ""Red-Blue Decompositions and Switch-Regularity""; ""Characterization and Test""; ""Conclusions and Open Problems ""; ""References""; ""A Global k-Level Crossing Reduction Algorithm""; ""Introduction""; ""Preliminaries""; ""Global Sifting""; ""Building the Block List""; ""Initialization of a Sifting Step""; ""Sifting Step""; ""Sifting Swap""; ""Time Complexity""; ""Simple Global Crossing Reductions""; ""Experimental Results""
""Applications of the Global Crossing Reduction""""Summary""; ""References""; ""Computational Geometry""; ""Computation of Non-dominated Points Using Compact Voronoi Diagrams""; ""Introduction""; ""Formal Definition""; ""Prior Work""; ""Our Work""; ""Reduction to a Voronoi Diagram""; ""Dominated Points and the Cone""; ""Relation of Lower Envelope of Cones to Additively Weighted Voronoi Diagrams of a Convex Distance Function""; ""Reduction of Lower Envelope of Cones to Additively Weighted Voronoi Diagrams of a Convex Distance Function""; ""Computing Non-dominance in the Plane""
""Geometric Preliminaries""
Dieser Titel hat keine Exemplare