Algorithms and discrete applied mathematics : third International Conference, CALDAM 2017, Sancoale, Goa, India, February 16-18, 2017, Proceedings /: third International Conference, CALDAM 2017, Sancoale, Goa, India, February 16-18, 2017, Proceedings. (2017)

• Record Type: Book
• Other Titles: CALDAM 2017
• Further Information: Note: Daya Gaur, N.S. Narayanaswamy (eds.).
• Editors: Gaur, Daya Ram, 1969-; Narayanaswamy, N. S
• Other Names: CALDAM (Conference), 3rd
• Contents: Optimal embedding of locally twisted cubes into grids -- Polynomial Time Algorithms for Bichromatic Problems -- Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function -- Optimum Gathering of Asynchronous Robots -- Improved bounds for poset sorting in the forbidden-comparison regime -- Positional Dominance: Concepts and Algorithms -- Accurate Low-Space Approximation of Metric k-Median for Insertion-Only Streams -- Querying Relational Event Graphs using Colored Range Searching Data Structures -- Axiomatic Characterization of the Interval Function of a Bipartite Graph -- Analysis of 2-Opt Heuristic for the Winner Determination Problem under the Chamberlin-Courant System -- On Structural Parameterizations of Graph Motif and Chromatic Number -- On chromatic number of colored mixed graphs -- Optimizing movement in a convex path-network to establish connectivity -- On colouring point visibility graphs -- Decomposing semi-complete multigraphs and directed graphs into paths of length two -- On Rank and MDR Cyclic codes of length 2k over Z8 -- Group Distance Magic Labeling of Crn -- Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs -- Incremental algorithms to update visibility polygons -- Liar's Domination in 2D -- Structured Instances of Restricted Assignment with Two Processing Times -- Elusiveness of finding degrees -- Maximum weighted independent sets with a budget -- Demand hitting and covering of intervals -- Exact And Parameterized Algorithms For (k; i)-coloring -- The Graph of the Pedigree Polytope is Asymptotically Almost Complete.? Induced matching in some subclasses of bipartite graphs -- Hamiltonicity in Split Graphs -- a dichotomy -- Finding Large Independent Sets in Line of Sight Networks -- A lower bound of the cd-chromatic number and its complexity -- Stability number and k-Hamiltonian [a, b]-factors -- Subgraphs with orthogonal [0; ki]n1-factorizations in graphs.
• Publisher Details: Cham, Switzerland : Springer
• Publication Date: 2017
• Extent: 1 online resource (xix, 372 pages), illustrations
• Subjects: 004.01/51; Computer science; Computer science -- Mathematics -- Congresses; Algorithms -- Congresses; Algorithms; Computer science -- Mathematics; Computer Science; Algorithm Analysis and Problem Complexity; Data Structures; Discrete Mathematics in Computer Science; Numeric Computing; Computer Graphics; Algorithms; Computers -- Data Modeling & Design; Computers -- Data Processing; Computers -- Programming -- Algorithms; Computers -- Computer Graphics; Algorithms & data structures; Discrete mathematics; Mathematical theory of computation; Graphics programming; Numerical analysis; Computer software; Data structures (Computer science); Computational complexity; Electronic data processing; Computer graphics; Algorithms; Electronic books; Conference papers and proceedings; Electronic books
• Languages: English
• ISBNs: 9783319530079; 3319530070; 3319530062; 9783319530062
• Related ISBNs: 9783319530062
• Notes: Note: Online resource; title from PDF title page (SpringerLink, viewed February 9, 2017).
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.