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] ] : 4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings / / edited by B.S. Panda, Partha P. Goswami
| Algorithms and Discrete Applied Mathematics [[electronic resource] ] : 4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings / / edited by B.S. Panda, Partha P. Goswami |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XVI, 301 p. 58 illus.) |
| Disciplina | 511.8 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Artificial intelligence—Data processing Computer graphics Mathematics of Computing Data Science Computer Graphics |
| ISBN | 3-319-74180-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Efficient Domination and Efficient Edge Domination: A Brief Survey -- Mixed Unit Interval Bigraphs.-Hamiltonian Path in K1,t-free split Graphs – a Dichotomy -- A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems -- Probabilistic Properties of Highly Connected Random Geometric Graphs -- On Indicated Coloring of Some Classes of Graphs -- Line Segment Disk Cover -- Fixed-parameter tractable algorithms for Tracking Set Problems -- Exact computation of the number of accepting paths of an NTM -- Determining Minimal Degree Polynomials of a Cyclic Code of length 2^k over Z8 -- Consistent Subset Problem with two labels -- The Edge Geodetic Number of Product Graphs -- Burning Spiders -- Drawing Graphs on Few Circles and Few Spheres -- On a lower bound for the eccentric connectivity index of graphs -- On the Tractability of (k,i)-Coloring -- Window Queries for Problems on Intersecting Objects and Maximal Points -- Bounded stub resolution for some maximal 1-planar graphs -- On Structural Parameterizations of Firefighting -- On the Simultaneous Minimum Spanning Trees Problem -- Variations of cops and robbers game on grids -- Alternation, Sparsity and Sensitivity : Combinatorial Bounds and Exponential Gaps -- On oriented L(p; 1)-labeling -- Radius, Diameter, Incenter, Circumcenter, Width and Minimum Enclosing Cylinder for Some Polyhedral Distance Functions. |
| Record Nr. | UNISA-996466471303316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Discrete Applied Mathematics : 4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings / / edited by B.S. Panda, Partha P. Goswami
| Algorithms and Discrete Applied Mathematics : 4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings / / edited by B.S. Panda, Partha P. Goswami |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XVI, 301 p. 58 illus.) |
| Disciplina | 511.8 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science - Mathematics Artificial intelligence - Data processing Computer graphics Mathematics of Computing Data Science Computer Graphics |
| ISBN | 3-319-74180-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Efficient Domination and Efficient Edge Domination: A Brief Survey -- Mixed Unit Interval Bigraphs.-Hamiltonian Path in K1,t-free split Graphs – a Dichotomy -- A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems -- Probabilistic Properties of Highly Connected Random Geometric Graphs -- On Indicated Coloring of Some Classes of Graphs -- Line Segment Disk Cover -- Fixed-parameter tractable algorithms for Tracking Set Problems -- Exact computation of the number of accepting paths of an NTM -- Determining Minimal Degree Polynomials of a Cyclic Code of length 2^k over Z8 -- Consistent Subset Problem with two labels -- The Edge Geodetic Number of Product Graphs -- Burning Spiders -- Drawing Graphs on Few Circles and Few Spheres -- On a lower bound for the eccentric connectivity index of graphs -- On the Tractability of (k,i)-Coloring -- Window Queries for Problems on Intersecting Objects and Maximal Points -- Bounded stub resolution for some maximal 1-planar graphs -- On Structural Parameterizations of Firefighting -- On the Simultaneous Minimum Spanning Trees Problem -- Variations of cops and robbers game on grids -- Alternation, Sparsity and Sensitivity : Combinatorial Bounds and Exponential Gaps -- On oriented L(p; 1)-labeling -- Radius, Diameter, Incenter, Circumcenter, Width and Minimum Enclosing Cylinder for Some Polyhedral Distance Functions. |
| Record Nr. | UNINA-9910349437503321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theoretical Computer Science and Discrete Mathematics [[electronic resource] ] : First International Conference, ICTCSDM 2016, Krishnankoil, India, December 19-21, 2016, Revised Selected Papers / / edited by S. Arumugam, Jay Bagga, Lowell W. Beineke, B.S. Panda
| Theoretical Computer Science and Discrete Mathematics [[electronic resource] ] : First International Conference, ICTCSDM 2016, Krishnankoil, India, December 19-21, 2016, Revised Selected Papers / / edited by S. Arumugam, Jay Bagga, Lowell W. Beineke, B.S. Panda |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XIII, 458 p. 122 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Artificial intelligence—Data processing Image processing—Digital techniques Computer vision Data protection Artificial intelligence Discrete Mathematics in Computer Science Data Science Computer Imaging, Vision, Pattern Recognition and Graphics Data and Information Security Artificial Intelligence |
| ISBN | 3-319-64419-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Contents -- Degree Associated Reconstruction Number of Biregular Bipartite Graphs Whose Degrees Differ by at Least Two -- 1 Introduction -- 2 Drn of Biregular Bipartite Graphs -- References -- 1-Normal DRA for Insertion Languages -- 1 Introduction -- 2 Preliminaries -- 2.1 Restarting Automaton with Delete Operation (DRA) -- 2.2 Insertion Grammars -- 3 1-Normal DRA -- 4 1-Normal DRA and Insertion Grammar -- 5 The Power of 1-Normal DRA -- 6 Conclusion -- References -- Formal Language Representation and Modelling Structures Underlying RNA Folding Process -- 1 Introduction -- 2 Preliminaries -- 2.1 Matrix Insertion-Deletion Systems -- 3 Modelling Bio-Molecular Structures -- 4 Conclusion -- References -- Homometric Number of a Graph and Some Related Concepts -- 1 Introduction -- 1.1 Basic Definitions and Preliminaries -- 2 Homometric Number -- 3 Regular Graphs -- 4 Some Related Graph Parameters -- References -- Forbidden Subgraphs of Bigraphs of Ferrers Dimension 2 -- 1 Introduction -- 2 Forbidden Induced Subgraphs of ATE - Free Bigraphs of Ferrers Dimension 2 -- References -- Global Secure Domination in Graphs -- 1 Introduction -- 2 Main Results -- 3 Conclusion and Scope -- References -- A Novel Reversible Data Hiding Method in Teleradiology to Maximize Data Capacity in Medical Images -- 1 Introduction -- 2 Proposed Method -- 2.1 Image Encryption -- 2.2 Pre-processing and Location Map -- 2.3 Duplicating Pixel Values -- 2.4 Data Embedding, Extracting and Recovery -- 3 Experimental Results -- 3.1 6-Rounds Duplicating for Improving Data Capacity -- 3.2 File Size -- 3.3 Reversibility -- 4 Conclusion -- References -- Indicated Coloring of Cartesian Product of Graphs -- 1 Introduction -- 2 Indicated Coloring on Cartesian Product of Graphs -- References.
A Bi-level Security Mechanism for Efficient Protection on Graphs in Online Social Network -- 1 Introduction -- 2 Privacy Requirements of Big Data -- 3 Existing Mechanisms for Data Privacy and Graph Protection -- 4 Cosine Similarity with P-Stability -- 5 Performance Evaluation -- 6 Conclusion -- References -- On Nearly Distance Magic Graphs -- 1 Introduction -- 2 Main Results -- 3 Conclusion and Scope -- References -- Evenly Partite Directed Bigraph Factorization of Wreath Product of Graphs -- 1 Introduction -- 2 Evenly Partite Directed Bigraph Factorization of (CmKn)* -- 3 Evenly Partite Directed Bigraph Factorization of (KmKn)* -- 4 Conclusion -- References -- Minimum Layout of Circulant Graphs into Certain Height Balanced Trees -- 1 Introduction -- 2 Main Results -- 3 Conclusion -- References -- Dissecting Power of Certain Matrix Languages -- 1 Introduction -- 2 Preliminaries -- 3 Dissecting Matrix Languages -- 4 Conclusion -- References -- Degree Associated Reconstruction Number of Split Graphs with Regular Independent Set -- 1 Introduction -- 2 Drn of Split Graphs -- 3 Conclusion -- References -- Distance Antimagic Labelings of Graphs -- 1 Introduction -- 2 Main Results -- 3 Conclusion and Scope -- References -- Probabilistic Conjunctive Grammar -- 1 Introduction -- 2 Context-Free Grammar (CFG) and Probabilistic Context-Free Grammar (PCFG) -- 3 Conjunctive Grammar (CG) and Probabilistic Conjunctive Grammar (PCG) -- 3.1 Binary Normal Form of PCG -- 4 Conclusion -- References -- (1, 2)-Domination in Graphs -- 1 Introduction -- 2 Bounds of 1, 2 in terms of -- 3 Composition of Two Graphs -- 4 Some Characterizations -- 5 Trees -- References -- New Construction on SD-Prime Cordial Labeling -- 1 Introduction -- 2 Main Results -- References -- Dominator Coloring of Generalized Petersen Graphs -- 1 Introduction -- 2 Main Results -- 3 Conclusion. References -- Super Edge-Antimagic Gracefulness of Disconnected Graphs -- 1 Introduction -- 2 Main Results -- References -- Mixed Noise Elimination and Data Hiding for Secure Data Transmission -- 1 Introduction -- 2 Module Description -- 2.1 Pre-processing -- 2.2 Filtering -- 2.3 Denoising -- 2.4 Transmitter Side -- 2.5 Receiver Side -- 3 Proposed System Process Flow Diagram -- 3.1 Results and Discussion -- 4 Conclusion -- References -- Analysis of Particle Swarm Optimization Based 2D FIR Filter for Reduction of Additive and Multiplicative Noise in Images -- 1 Introduction -- 2 Previous Works -- 3 Two Dimensional FIR Filter -- 4 Median Filter -- 5 Additive and Multiplicative Noise in Images -- 5.1 Additive Noise -- 5.2 Multiplicative Noise -- 6 Particle Swarm Optimization -- 7 Design Formulation -- 8 Results and Discussion -- 9 Conclusion -- References -- Irregularity Strength of Corona of Two Graphs -- 1 Introduction -- 2 Main Results -- 3 Conclusion and Scope -- References -- 1-Distant Irregularity Strength of Graphs -- 1 Introduction -- 2 1-Distant Irregularity Strength of Certain Families of Graphs -- 3 Conclusion and Scope -- References -- Cloud Data Security Based on Data Partitions and Multiple Encryptions -- 1 Introduction -- 2 Proposed Scheme -- 2.1 Algorithm for Encryption -- 2.2 Algorithm for Decryption -- 3 Implementation and Testing -- 4 Conclusion -- 5 Future Work -- References -- Upper Majority Domination Number of a Graph -- 1 Introduction -- 2 Upper Majority Domination -- 3 Conclusion and Scope -- References -- Super (a, 3)-edge Antimagic Total Labeling for Union of Two Stars -- 1 Introduction -- 2 Main Results -- 3 Conclusion and Scope -- References -- On Determinant of Laplacian Matrix and Signless Laplacian Matrix of a Simple Graph -- 1 Introduction -- 2 Laplacian Matrix and Signless Laplacian Matrix. 3 Determinant of Laplacian Matrix and Signless Laplacian Matrix -- 4 Conclusion -- References -- On the Complexity of Minimum Cardinality Maximal Uniquely Restricted Matching in Graphs -- 1 Introduction -- 2 Preliminaries -- 3 NP-completeness Results -- 4 Hardness of Approximating Min-UR-Matching -- 5 Chain Graphs -- 6 Conclusion -- References -- Partial Grundy Coloring in Some Subclasses of Bipartite Graphs and Chordal Graphs -- 1 Introduction -- 2 Preliminaries -- 3 Partial Grundy Coloring in Perfect Elimination Bipartite Graph -- 4 Grundy Coloring in Chain Graph -- 5 Partial Grundy Coloring in Subclasses of Chordal Graphs -- 6 Conclusion -- References -- On Prime Distance Labeling of Graphs -- 1 Introduction -- 2 Main Results -- References -- Dominator Colorings of Products of Graphs -- 1 Introduction -- 2 Dominator Chromatic Number of the Tensor Product of Graphs -- 3 Dominator Chromatic Number of the Cartesian Product of Graphs -- 4 Conclusion -- References -- Efficient Hybrid Approach for Compression of Multi Modal Medical Images -- 1 Introduction -- 2 Related Works -- 3 Methodologies for Medical Image Compression -- 3.1 Fractal Algorithm -- 3.2 Radial Basis Function Neural Network (RBFNN) for Image Compression -- 3.3 Hybrid Image Compression -- 4 Performance Parameters -- 5 Results -- 5.1 Compression Ratio -- 5.2 PSNR -- 5.3 Memory -- 6 Conclusion and Future Work -- References -- The Median Problem on Symmetric Bipartite Graphs -- 1 Introduction -- 2 Median Problem on Symmetric Bipartite Graphs -- 3 Bipartite Graph of a Graph -- 4 The Median Problem on Square of Bipartite Graphs -- References -- Intuitionistic Fuzzy Automaton with Unique Membership and Unique Nonmembership Transitions -- 1 Introduction -- 1.1 Basic Definitions -- 2 Unique Membership and Unique Non Membership Transitions. 3 Complete Intuitionistic Fuzzy Automaton with Unique Membership and Unique Nonmembership Transitions -- 4 Conclusion -- References -- Independent 2-Point Set Domination in Graphs -- 1 Introduction -- 2 Basic Results -- 3 Some Classes of i-2psd Graphs -- 4 Conclusion -- References -- On Graphs Whose Graphoidal Length Is Half of Its Size -- 1 Introduction -- 1.1 Terminology and Notation -- 2 Graphs with Graphoidal Length "4262304 q/2"5263305 -- 3 Characterization of Graphs in F* -- 4 Conclusion -- References -- Point-Set Domination in Graphs. VIII: Perfect and Efficient PSD Sets -- 1 Introduction -- 2 Perfect and Efficient Psd-Sets -- 3 Conclusion and Scope -- References -- Graphoidal Length and Graphoidal Covering Number of a Graph -- 1 Introduction -- 2 Main Results -- 3 Conclusion and Scope -- References -- An Overview of the MapReduce Model -- 1 Introduction -- 2 Implementation Scrutiny -- 2.1 Categorization -- 2.2 Feature Selection -- 2.3 C5.0 Classifier -- 3 Conclusion -- References -- Identification of Salinity Stress Tolerant Proteins in Sorghum Bicolor Computational Approach -- 1 Introduction -- 2 Materials and Methods -- 2.1 String Database -- 2.2 Cytoscape -- 2.3 Topological Analysis -- 2.4 Functional Enrichment Analysis -- 3 Results -- 4 Discussion -- 5 Conclusion -- References -- On Total Roman Domination in Graphs -- 1 Introduction -- 2 Bounds on Total Roman Domination Number -- 3 Bounds in Terms of Girth -- References -- Restrained Differential of a Graph -- 1 Introduction -- 2 Notations -- 3 Restrained Differential Values of Some Standard Graphs -- 4 Bounds on (G) -- References -- The Distinguishing Number of Kronecker Product of Two Graphs -- 1 Introduction -- 2 Main Results -- References -- Grammar Systems Based on Equal Matrix Rules and Alphabetic Flat Splicing -- 1 Introduction -- 2 Preliminaries. 3 Alphabetic Flat Splicing Equal Matrix Grammar Systems. |
| Record Nr. | UNISA-996466198903316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theoretical Computer Science and Discrete Mathematics : First International Conference, ICTCSDM 2016, Krishnankoil, India, December 19-21, 2016, Revised Selected Papers / / edited by S. Arumugam, Jay Bagga, Lowell W. Beineke, B.S. Panda
| Theoretical Computer Science and Discrete Mathematics : First International Conference, ICTCSDM 2016, Krishnankoil, India, December 19-21, 2016, Revised Selected Papers / / edited by S. Arumugam, Jay Bagga, Lowell W. Beineke, B.S. Panda |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XIII, 458 p. 122 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science - Mathematics
Discrete mathematics Algorithms Artificial intelligence - Data processing Image processing - Digital techniques Computer vision Data protection Artificial intelligence Discrete Mathematics in Computer Science Data Science Computer Imaging, Vision, Pattern Recognition and Graphics Data and Information Security Artificial Intelligence |
| ISBN | 3-319-64419-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Contents -- Degree Associated Reconstruction Number of Biregular Bipartite Graphs Whose Degrees Differ by at Least Two -- 1 Introduction -- 2 Drn of Biregular Bipartite Graphs -- References -- 1-Normal DRA for Insertion Languages -- 1 Introduction -- 2 Preliminaries -- 2.1 Restarting Automaton with Delete Operation (DRA) -- 2.2 Insertion Grammars -- 3 1-Normal DRA -- 4 1-Normal DRA and Insertion Grammar -- 5 The Power of 1-Normal DRA -- 6 Conclusion -- References -- Formal Language Representation and Modelling Structures Underlying RNA Folding Process -- 1 Introduction -- 2 Preliminaries -- 2.1 Matrix Insertion-Deletion Systems -- 3 Modelling Bio-Molecular Structures -- 4 Conclusion -- References -- Homometric Number of a Graph and Some Related Concepts -- 1 Introduction -- 1.1 Basic Definitions and Preliminaries -- 2 Homometric Number -- 3 Regular Graphs -- 4 Some Related Graph Parameters -- References -- Forbidden Subgraphs of Bigraphs of Ferrers Dimension 2 -- 1 Introduction -- 2 Forbidden Induced Subgraphs of ATE - Free Bigraphs of Ferrers Dimension 2 -- References -- Global Secure Domination in Graphs -- 1 Introduction -- 2 Main Results -- 3 Conclusion and Scope -- References -- A Novel Reversible Data Hiding Method in Teleradiology to Maximize Data Capacity in Medical Images -- 1 Introduction -- 2 Proposed Method -- 2.1 Image Encryption -- 2.2 Pre-processing and Location Map -- 2.3 Duplicating Pixel Values -- 2.4 Data Embedding, Extracting and Recovery -- 3 Experimental Results -- 3.1 6-Rounds Duplicating for Improving Data Capacity -- 3.2 File Size -- 3.3 Reversibility -- 4 Conclusion -- References -- Indicated Coloring of Cartesian Product of Graphs -- 1 Introduction -- 2 Indicated Coloring on Cartesian Product of Graphs -- References.
A Bi-level Security Mechanism for Efficient Protection on Graphs in Online Social Network -- 1 Introduction -- 2 Privacy Requirements of Big Data -- 3 Existing Mechanisms for Data Privacy and Graph Protection -- 4 Cosine Similarity with P-Stability -- 5 Performance Evaluation -- 6 Conclusion -- References -- On Nearly Distance Magic Graphs -- 1 Introduction -- 2 Main Results -- 3 Conclusion and Scope -- References -- Evenly Partite Directed Bigraph Factorization of Wreath Product of Graphs -- 1 Introduction -- 2 Evenly Partite Directed Bigraph Factorization of (CmKn)* -- 3 Evenly Partite Directed Bigraph Factorization of (KmKn)* -- 4 Conclusion -- References -- Minimum Layout of Circulant Graphs into Certain Height Balanced Trees -- 1 Introduction -- 2 Main Results -- 3 Conclusion -- References -- Dissecting Power of Certain Matrix Languages -- 1 Introduction -- 2 Preliminaries -- 3 Dissecting Matrix Languages -- 4 Conclusion -- References -- Degree Associated Reconstruction Number of Split Graphs with Regular Independent Set -- 1 Introduction -- 2 Drn of Split Graphs -- 3 Conclusion -- References -- Distance Antimagic Labelings of Graphs -- 1 Introduction -- 2 Main Results -- 3 Conclusion and Scope -- References -- Probabilistic Conjunctive Grammar -- 1 Introduction -- 2 Context-Free Grammar (CFG) and Probabilistic Context-Free Grammar (PCFG) -- 3 Conjunctive Grammar (CG) and Probabilistic Conjunctive Grammar (PCG) -- 3.1 Binary Normal Form of PCG -- 4 Conclusion -- References -- (1, 2)-Domination in Graphs -- 1 Introduction -- 2 Bounds of 1, 2 in terms of -- 3 Composition of Two Graphs -- 4 Some Characterizations -- 5 Trees -- References -- New Construction on SD-Prime Cordial Labeling -- 1 Introduction -- 2 Main Results -- References -- Dominator Coloring of Generalized Petersen Graphs -- 1 Introduction -- 2 Main Results -- 3 Conclusion. References -- Super Edge-Antimagic Gracefulness of Disconnected Graphs -- 1 Introduction -- 2 Main Results -- References -- Mixed Noise Elimination and Data Hiding for Secure Data Transmission -- 1 Introduction -- 2 Module Description -- 2.1 Pre-processing -- 2.2 Filtering -- 2.3 Denoising -- 2.4 Transmitter Side -- 2.5 Receiver Side -- 3 Proposed System Process Flow Diagram -- 3.1 Results and Discussion -- 4 Conclusion -- References -- Analysis of Particle Swarm Optimization Based 2D FIR Filter for Reduction of Additive and Multiplicative Noise in Images -- 1 Introduction -- 2 Previous Works -- 3 Two Dimensional FIR Filter -- 4 Median Filter -- 5 Additive and Multiplicative Noise in Images -- 5.1 Additive Noise -- 5.2 Multiplicative Noise -- 6 Particle Swarm Optimization -- 7 Design Formulation -- 8 Results and Discussion -- 9 Conclusion -- References -- Irregularity Strength of Corona of Two Graphs -- 1 Introduction -- 2 Main Results -- 3 Conclusion and Scope -- References -- 1-Distant Irregularity Strength of Graphs -- 1 Introduction -- 2 1-Distant Irregularity Strength of Certain Families of Graphs -- 3 Conclusion and Scope -- References -- Cloud Data Security Based on Data Partitions and Multiple Encryptions -- 1 Introduction -- 2 Proposed Scheme -- 2.1 Algorithm for Encryption -- 2.2 Algorithm for Decryption -- 3 Implementation and Testing -- 4 Conclusion -- 5 Future Work -- References -- Upper Majority Domination Number of a Graph -- 1 Introduction -- 2 Upper Majority Domination -- 3 Conclusion and Scope -- References -- Super (a, 3)-edge Antimagic Total Labeling for Union of Two Stars -- 1 Introduction -- 2 Main Results -- 3 Conclusion and Scope -- References -- On Determinant of Laplacian Matrix and Signless Laplacian Matrix of a Simple Graph -- 1 Introduction -- 2 Laplacian Matrix and Signless Laplacian Matrix. 3 Determinant of Laplacian Matrix and Signless Laplacian Matrix -- 4 Conclusion -- References -- On the Complexity of Minimum Cardinality Maximal Uniquely Restricted Matching in Graphs -- 1 Introduction -- 2 Preliminaries -- 3 NP-completeness Results -- 4 Hardness of Approximating Min-UR-Matching -- 5 Chain Graphs -- 6 Conclusion -- References -- Partial Grundy Coloring in Some Subclasses of Bipartite Graphs and Chordal Graphs -- 1 Introduction -- 2 Preliminaries -- 3 Partial Grundy Coloring in Perfect Elimination Bipartite Graph -- 4 Grundy Coloring in Chain Graph -- 5 Partial Grundy Coloring in Subclasses of Chordal Graphs -- 6 Conclusion -- References -- On Prime Distance Labeling of Graphs -- 1 Introduction -- 2 Main Results -- References -- Dominator Colorings of Products of Graphs -- 1 Introduction -- 2 Dominator Chromatic Number of the Tensor Product of Graphs -- 3 Dominator Chromatic Number of the Cartesian Product of Graphs -- 4 Conclusion -- References -- Efficient Hybrid Approach for Compression of Multi Modal Medical Images -- 1 Introduction -- 2 Related Works -- 3 Methodologies for Medical Image Compression -- 3.1 Fractal Algorithm -- 3.2 Radial Basis Function Neural Network (RBFNN) for Image Compression -- 3.3 Hybrid Image Compression -- 4 Performance Parameters -- 5 Results -- 5.1 Compression Ratio -- 5.2 PSNR -- 5.3 Memory -- 6 Conclusion and Future Work -- References -- The Median Problem on Symmetric Bipartite Graphs -- 1 Introduction -- 2 Median Problem on Symmetric Bipartite Graphs -- 3 Bipartite Graph of a Graph -- 4 The Median Problem on Square of Bipartite Graphs -- References -- Intuitionistic Fuzzy Automaton with Unique Membership and Unique Nonmembership Transitions -- 1 Introduction -- 1.1 Basic Definitions -- 2 Unique Membership and Unique Non Membership Transitions. 3 Complete Intuitionistic Fuzzy Automaton with Unique Membership and Unique Nonmembership Transitions -- 4 Conclusion -- References -- Independent 2-Point Set Domination in Graphs -- 1 Introduction -- 2 Basic Results -- 3 Some Classes of i-2psd Graphs -- 4 Conclusion -- References -- On Graphs Whose Graphoidal Length Is Half of Its Size -- 1 Introduction -- 1.1 Terminology and Notation -- 2 Graphs with Graphoidal Length "4262304 q/2"5263305 -- 3 Characterization of Graphs in F* -- 4 Conclusion -- References -- Point-Set Domination in Graphs. VIII: Perfect and Efficient PSD Sets -- 1 Introduction -- 2 Perfect and Efficient Psd-Sets -- 3 Conclusion and Scope -- References -- Graphoidal Length and Graphoidal Covering Number of a Graph -- 1 Introduction -- 2 Main Results -- 3 Conclusion and Scope -- References -- An Overview of the MapReduce Model -- 1 Introduction -- 2 Implementation Scrutiny -- 2.1 Categorization -- 2.2 Feature Selection -- 2.3 C5.0 Classifier -- 3 Conclusion -- References -- Identification of Salinity Stress Tolerant Proteins in Sorghum Bicolor Computational Approach -- 1 Introduction -- 2 Materials and Methods -- 2.1 String Database -- 2.2 Cytoscape -- 2.3 Topological Analysis -- 2.4 Functional Enrichment Analysis -- 3 Results -- 4 Discussion -- 5 Conclusion -- References -- On Total Roman Domination in Graphs -- 1 Introduction -- 2 Bounds on Total Roman Domination Number -- 3 Bounds in Terms of Girth -- References -- Restrained Differential of a Graph -- 1 Introduction -- 2 Notations -- 3 Restrained Differential Values of Some Standard Graphs -- 4 Bounds on (G) -- References -- The Distinguishing Number of Kronecker Product of Two Graphs -- 1 Introduction -- 2 Main Results -- References -- Grammar Systems Based on Equal Matrix Rules and Alphabetic Flat Splicing -- 1 Introduction -- 2 Preliminaries. 3 Alphabetic Flat Splicing Equal Matrix Grammar Systems. |
| Record Nr. | UNINA-9910484738903321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||