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

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

Edizione	[1st ed. 2016.]
Pubbl/distr/stampa	Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016
Descrizione fisica	1 online resource (XIII, 369 p. 76 illus. in color.)
Disciplina	005.1
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-29221-8
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Algorithms for Problems on Maximum Density Segment -- Distance spectral radius of k-partitioned transmission regular graphs -- Color Spanning Objects: Algorithms and Hardness Results -- On Hamiltonian colorings of trees -- On the Complexity Landscape of the Domination Chain -- On the probability of being synchronizable -- Linear-Time Fitting of a k-Step Function -- Random-bit optimal uniform sampling for rooted planar trees with given sequence of degrees and Applications -- Axiomatic Characterization of Claw and Paw-free Graphs Using Graph Transit Functions -- Linear time algorithms for Euclidean 1-center in higher dimensions with non-linear convex constraints -- Lower Bounds on the Dilation of Plane Spanners -- Lattice Spanners of Low Degree -- AND-Decomposition of Boolean Polynomials with Prescribed Shared Variables -- Approximation Algorithms for Cumulative VRP with Stochastic Demands -- Some Distance Antimagic Labelled Graphs -- A New Construction of Broadcast Graphs -- Improved Algorithm for Maximum Independent Set on Unit Disk Graph -- Independent Sets in Classes Related to Chair-free Graphs -- Cyclic Codes over Galois Rings -- On The Center Sets of Some Graph Classes -- On Irreducible No-hole L(2,1)-labelings of Hypercubes and Triangular Lattices -- Medians of permutations : building constraints -- b-Disjunctive total domination in graphs: Algorithm and hardness results -- m-Gracefulness of Graphs -- Domination Parameters in Hypertree -- Complexity of Steiner Tree in Split Graphs - Dichotomy Results -- Relative clique number of planar signed graphs -- The cd-coloring of graphs -- Characterization of H-graphs -- On the Power Domination Number of Graph Products.
Record Nr.	UNISA-996466357803316

Edizione	[1st ed. 2015.]
Pubbl/distr/stampa	Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015
Descrizione fisica	1 online resource (XVI, 300 p. 91 illus.) : online resource
Disciplina	005.3
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-14974-1
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Obstruction Characterizations in Graphs and Digraphs -- Approximation Algorithms -- A PTAS for the Metric Case of the Minimum Sum-Requirement Communication Spanning Tree Problem -- Constant Approximation for Broadcasting in k-cycle Graph -- Computational Geometry -- Three paths to point placement -- Vertex Guarding in Weak Visibility Polygons -- On Collections of Polygons Cuttable with a Segment Saw -- Rectilinear path problems in the presences of rectangular obstacles -- Computational Complexity -- Parameterized Analogues of Probabilistic Computation -- Algebraic Expressions of Rhomboidal Graphs -- Solving Hamiltonian Cycle by an EPT Algorithm for a Non-sparse Parameter -- Graph Theory. New Polynomial Case for Efficient Domination in P 6-free Graphs -- Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties -- Separator Theorems for Interval Graphs and Proper Interval Graphs -- Bounds for the b-Chromatic Number of Induced Subgraphs and G e -- New Characterizations Of Proper Interval Bigraphs and Proper Circular Arc Bigraphs -- On Spectra of Corona Graphs -- Axiomatic Characterization of the Median and Antimedian Functions on Cocktail-Party Graphs and Complete Graphs -- Tree Path Labeling of Hypergraphs A Generalization of the Consecutive Ones Property -- On a special class of boxicity 2 graph -- Algorithms -- Associativity for Binary Parallel Processes: a Quantitative Study -- A Tight Bound for Congestion of an Embedding.-Auction/Belief propagation algorithms for constrained assignment problem -- Domination in some subclasses of bipartite graphs -- Bi-directional Search for Skyline Probability -- Cumulative vehicle routing problem: a column generation approach -- Energy Efficient Sweep Coverage with Mobile and Static Sensors -- Generation of Random Digital Curves using Combinatorial Techniques.
Record Nr.	UNISA-996198833003316

Edizione	[1st ed. 2019.]
Pubbl/distr/stampa	Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Descrizione fisica	1 online resource (IX, 131 p. 24 illus., 14 illus. in color.)
Disciplina	005.1
Collana	Theoretical Computer Science and General Issues
Soggetto topico	Algorithms Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Artificial intelligence Computer graphics Discrete Mathematics in Computer Science Data Science Artificial Intelligence Computer Graphics
ISBN	3-030-25070-9
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Using Synthetic Networks for Parameter Tuning in Community Detection -- Efficiency of Transformations of Proximity Measures for Graph Clustering -- Almost Exact Recovery in Label Spreading -- Strongly n-e.c. Graphs and Independent Distinguishing Labellings -- The Robot Crawler Model on Complete k-Partite and Erdős-Rényi Random Graphs -- Estimating the Parameters of the Waxman Random Graph -- Understanding the Effectiveness of Data Reduction in Public Transportation Networks -- A Spatial Small-World Graph Arising from Activity-Based Reinforcement -- SimpleHypergraphs.jl - Novel Software Framework for Modelling and Analysis of Hypergraphs. .
Record Nr.	UNISA-996466371703316