Algorithms and Data Structures - Info and Reading Options

Open Data:

Intro -- Preface -- Organization -- Contents -- Contact Graphs of Circular Arcs -- 1 Introduction -- 2 Contact Representations from Henneberg Moves -- 3 Good Orientations and One-Sided Representations -- 4 Contact Representations with Wedges -- 5 Conclusion and Open Questions -- References -- Contact Representations of Graphs in 3D -- 1 Introduction -- 2 Primal-Dual Contact Representations -- 3 L-Contact Representation of Optimal 1-Planar Graphs -- 4 Conclusion and Open Questions -- References -- Minimizing the Aggregate Movements for Interval Coverage -- 1 Introduction -- 2 Preliminaries -- 3 The Containing Case -- 4 The One-Sided Case -- 5 The General Case -- References -- Online Bin Packing with Advice of Small Size -- 1 Introduction -- 1.1 Previous Work and Our Contribution -- 2 Constant-Size Advice Outperforms All Online Algorithms -- 3 Beyond 1.5-competitiveness with O(1) Advice Bits -- 3.1 Sequences with Items Larger than 1/3 -- 3.2 Arbitrary Sequences -- 4 A 7/6 Lower Bound for Sublinear-Sized Advice -- References -- On the Approximability of Orthogonal Order Preserving Layout Adjustment -- 1 Introduction -- 1.1 Previous Work -- 1.2 Related Work -- 1.3 Our Results -- 2 Preliminaries -- 3 Reduction of LADS to Hitting Set -- 4 Inapproximability of Layout Adjustment Problems -- 5 Approximation Algorithm -- References -- An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs -- 1 Introduction -- 1.1 Previous Work -- 1.1.1 2-Colored Point Sets -- 1.1.2 3-Colored Point Sets -- 1.1.3 Multicolored Point Sets -- 1.2 Our Contribution -- 2 Balanced Cut Theorem -- 3 Plane Colored Matching Algorithm -- 3.1 Maximum Matching -- References -- Generation of Colourings and Distinguishing Colourings of Graphs -- 1 Colourings of Graphs -- 2 Generating All k-colourings up to Isomorphism -- 2.1 The Permutation List Algorithm

Search for “Algorithms and Data Structures” downloads:

Visit our Downloads Search page to see if downloads are available.

Find “Algorithms and Data Structures” in Libraries Near You:

Read or borrow “Algorithms and Data Structures” from your local library.

• The WorldCat Libraries Catalog: Find a copy of “Algorithms and Data Structures” at a library near you.