Coverart for item
The Resource Algorithms and discrete applied mathematics : third International Conference, CALDAM 2017, Sancoale, Goa, India, February 16-18, 2017, Proceedings, Daya Gaur, N.S. Narayanaswamy (eds.), (electronic book)

Algorithms and discrete applied mathematics : third International Conference, CALDAM 2017, Sancoale, Goa, India, February 16-18, 2017, Proceedings, Daya Gaur, N.S. Narayanaswamy (eds.), (electronic book)

Label
Algorithms and discrete applied mathematics : third International Conference, CALDAM 2017, Sancoale, Goa, India, February 16-18, 2017, Proceedings
Title
Algorithms and discrete applied mathematics
Title remainder
third International Conference, CALDAM 2017, Sancoale, Goa, India, February 16-18, 2017, Proceedings
Statement of responsibility
Daya Gaur, N.S. Narayanaswamy (eds.)
Title variation
CALDAM 2017
Creator
Contributor
Editor
Subject
Genre
Language
eng
Summary
This book constitutes the proceedings of the Third International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2017, held in Goa, India, in February 2017. The 32 papers presented in this volume were carefully reviewed and selected from 103 submissions. They deal with the following areas: algorithms, graph theory, codes, polyhedral combinatorics, computational geometry, and discrete geometry.
Member of
Cataloging source
GW5XE
Dewey number
004.01/51
Illustrations
illustrations
Index
index present
LC call number
QA76.9.M35
LC item number
C35 2017eb
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2017
http://bibfra.me/vocab/lite/meetingName
CALDAM (Conference)
Nature of contents
dictionaries
http://library.link/vocab/relatedWorkOrContributorName
  • Gaur, Daya
  • Narayanaswamy, N. S.
Series statement
  • Lecture notes in computer science,
  • LNCS sublibrary. SL 1, Theoretical computer science and general issues
Series volume
10156
http://library.link/vocab/subjectName
  • Computer science
  • Algorithms
Label
Algorithms and discrete applied mathematics : third International Conference, CALDAM 2017, Sancoale, Goa, India, February 16-18, 2017, Proceedings, Daya Gaur, N.S. Narayanaswamy (eds.), (electronic book)
Instantiates
Publication
Note
  • International conference proceedings
  • Includes author index
Antecedent source
unknown
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
txt
Content type MARC source
rdacontent
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
Dimensions
unknown
Extent
1 online resource (xix, 372 pages)
File format
unknown
Form of item
online
Isbn
9783319530062
Level of compression
unknown
Media category
computer
Media MARC source
rdamedia
Media type code
c
Other control number
10.1007/978-3-319-53007-9
Other physical details
illustrations.
Quality assurance targets
not applicable
Reformatting quality
unknown
Sound
unknown sound
Specific material designation
remote
System control number
ocn971892872
Label
Algorithms and discrete applied mathematics : third International Conference, CALDAM 2017, Sancoale, Goa, India, February 16-18, 2017, Proceedings, Daya Gaur, N.S. Narayanaswamy (eds.), (electronic book)
Publication
Note
  • International conference proceedings
  • Includes author index
Antecedent source
unknown
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
txt
Content type MARC source
rdacontent
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
Dimensions
unknown
Extent
1 online resource (xix, 372 pages)
File format
unknown
Form of item
online
Isbn
9783319530062
Level of compression
unknown
Media category
computer
Media MARC source
rdamedia
Media type code
c
Other control number
10.1007/978-3-319-53007-9
Other physical details
illustrations.
Quality assurance targets
not applicable
Reformatting quality
unknown
Sound
unknown sound
Specific material designation
remote
System control number
ocn971892872

Library Locations

Processing Feedback ...