Overview

Full Product Details

Author:   Daya Gaur ,  Rogers Mathew
Publisher:   Springer International Publishing AG
Imprint:   Springer International Publishing AG
Volume:   15536
ISBN:  

9783031834370

ISBN 10:   3031834372
Pages:   370
Publication Date:   05 February 2025
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   Manufactured on demand  
We will order this item for you from a manufactured on demand supplier.

Table of Contents

.- Addressing Bias in Algorithmic Solutions: Exploring Vertex Cover and Feedback Vertex Set. .- Graceful coloring is computationally hard. .- Parameterized Complexity of Coupon Coloring of Graphs. .- Spectra of eccentricity matrices of product of graphs. .- Almost Empty Monochromatic Polygons in Planar Point Sets. .- On the parameterized Complexity of Odd Coloring. .- On full-separating sets in graphs. .- Polynomial time algorithms for Hop domination. .- Charging Station Placement for Limited Energy Robots. .- Multipacking in Euclidean Plane. .- Partial Domination in Some Geometric Intersection Graphs. .- Generalized Lettericity of Graphs. .- Polynomial-time algorithms for PATH COVER on trees and graphs of bounded treewidth. .- Fast FPT Algorithms for Grundy Number on Dense Graphs. .- On a Tight Bound for the Maximum Number of Vertices that Belong to Every Metric Basis. .- Algorithms and hardness results for the (3,1)-cover problem. .- Extension Perfect Roman Domination. .- A sub-quadratic algorithm for the minsum one sink location problem on balanced binary tree networks. .- Two Step Graph Protection Game. .- Bipartite Domination in Graphs: Complexity and Algorithms. .- Packing sets of paths, stars and triangles: tractability and approximability. .- Structural Parameterization of Minus Domination. .- An algebraic characterization of strong graphs. .- There are finitely many uniformly most reliable graphs of corank 5. .- Helly Number, Radon Number and Rank in $\Delta$-Convexity on Graphs. .- Forbidden induced subgraphs in iterative higher order line graphs. .- Total Domination and Open Packing in Two Subclasses of Triangle-free Graphs. .- The MASEMPR problem and its applications in logistics. .- Broadcast Graph Is NP-complete. .- Maximizing the Maximum Degree in Ordered Nearest Neighbor Graphs.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions