WALCOM: Algorithms and Computation
Springer Berlin (Verlag)
978-3-642-00201-4 (ISBN)
Invited Talks.- A Separator Theorem for String Graphs and Its Applications.- Foundations of Exact Rounding.- Approximating Shortest Paths in Graphs.- Line Transversals and Pinning Numbers.- Computational Geometry.- Algorithms for Computing Diffuse Reflection Paths in Polygons.- Shortest Gently Descending Paths.- All Farthest Neighbors in the Presence of Highways and Obstacles.- Improved Algorithm for a Widest 1-Corner Corridor.- Maximum Neighbour Voronoi Games.- On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem.- Graph Algorithms.- Colinear Coloring on Graphs.- Recursive Generation of 5-Regular Planar Graphs.- Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract).- Generating All Triangulations of Plane Graphs (Extended Abstract).- Recognition of Unigraphs through Superposition of Graphs (Extended Abstract).- Random Generation and Enumeration of Proper Interval Graphs.- A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs.- Minmax Tree Cover in the Euclidean Space.- Network Design with Weighted Degree Constraints.- Minimum Cuts of Simple Graphs in Almost Always Linear Time.- The Generalized Stable Allocation Problem.- Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings.- Core and Conditional Core Path of Specified Length in Special Classes of Graphs.- Complexity.- The Planar k-Means Problem is NP-Hard.- On the Computational Complexity of Monotone Constraint Satisfaction Problems.- Parameterized Complexity of Stabbing Rectangles and Squares in the Plane.- Graph Drawing.- Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n logn) Area (Extended Abstract).- Matched Drawability of Graph Pairs and of Graph Triples.- An Improved Upward Planarity Testing Algorithm and Related Applications.- Spherical-Rectangular Drawings.- Approximation Algorithms.- The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated.- The Minimal Manhattan Network Problem in Three Dimensions.- Randomized Algorithms.- Shape Matching by Random Sampling.- Object Caching for Queries and Updates.
| Erscheint lt. Verlag | 2.2.2009 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | XIII, 408 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 646 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
| Schlagworte | Algorithm analysis and problem complexity • algorithms • Approximation • Bioinformatics • Caching • classification • combinatorial optimization • Complexity • Computational Biology • Computational Complexity • Computational Geometry • Computational Graph Theory • distributed algorithms • Dynamic Programming • Enumeration • Game Theory • Graph Algorithms • Graph Drawing • grid drawing • Hardcover, Softcover / Informatik, EDV/Informatik • interval graphs • local searching • network algorithms • Network Optimization • online algorithms • ordered tree • Parallel Algorithms • plane graph • Random Graphs • Scheduling • sensor networks • Steiner tree • Voronoi diagram • Wireless Network • worst-case analysis |
| ISBN-10 | 3-642-00201-3 / 3642002013 |
| ISBN-13 | 978-3-642-00201-4 / 9783642002014 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
