Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Algorithms and Discrete Applied Mathematics [[electronic resource] ] : Third International Conference, CALDAM 2017, Sancoale, Goa, India, February 16-18, 2017, Proceedings / / edited by Daya Gaur, N.S. Narayanaswamy
| Algorithms and Discrete Applied Mathematics [[electronic resource] ] : Third International Conference, CALDAM 2017, Sancoale, Goa, India, February 16-18, 2017, Proceedings / / edited by Daya Gaur, N.S. Narayanaswamy |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XIX, 372 p. 72 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Numerical analysis Computer graphics Data Science Discrete Mathematics in Computer Science Numerical Analysis Computer Graphics |
| ISBN | 3-319-53007-0 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Record Nr. | UNISA-996465739303316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Discrete Applied Mathematics : Third International Conference, CALDAM 2017, Sancoale, Goa, India, February 16-18, 2017, Proceedings / / edited by Daya Gaur, N.S. Narayanaswamy
| Algorithms and Discrete Applied Mathematics : Third International Conference, CALDAM 2017, Sancoale, Goa, India, February 16-18, 2017, Proceedings / / edited by Daya Gaur, N.S. Narayanaswamy |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XIX, 372 p. 72 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Numerical analysis Computer graphics Data Science Discrete Mathematics in Computer Science Numerical Analysis Computer Graphics |
| ISBN | 3-319-53007-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Record Nr. | UNINA-9910484044003321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||