Search
Search Results
-
STIF: Intuitionistic fuzzy Gaussian membership function with statistical transformation weight of evidence and information value for private information preservation
Data sharing to the multiple organizations are essential for analysis in many situations. The shared data contains the individual’s private and...
-
S3QLRDF: distributed SPARQL query processing using Apache Spark—a comparative performance study
The proliferation of semantic data in the form of Resource Description Framework (RDF) triples demands an efficient, scalable, and distributed...
-
Algorithms and Discrete Applied Mathematics 9th International Conference, CALDAM 2023, Gandhinagar, India, February 9–11, 2023, Proceedings
This book constitutes the proceedings of the 9th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2023, which was held...
-
Coloring of a Superclass of \(2K_2\) -free graphs
The class of \(2K_2\) -free graphs has been well...
-
Some Insights on Dynamic Maintenance of Gomory-Hu Tree in Cactus Graphs and General Graphs
For any flow network, min(s, t)-cut query is a fundamental graph query that asks for a minimum weight cut that separates vertices s and t. Gomory and...
-
Relation Between Broadcast Domination and Multipacking Numbers on Chordal Graphs
For a graph \( G = (V, E) \) with a vertex set...
-
Latin Hexahedra and Related Combinatorial Structures
We introduce a system of Latin rectangles that is a combination of finite number of Latin rectangles that are given by either concrete Latin...
-
Algorithms for k-Dispersion for Points in Convex Position in the Plane
In this paper, we consider the following k-dispersion problem. Given a set S of n points placed in the plane in convex position and an integer k (...
-
The Weak (2, 2)-Labelling Problem for Graphs with Forbidden Induced Structures
The Weak (2, 2)-Conjecture is a graph labelling problem asking whether all connected graphs of at least three vertices can have their edges assigned...
-
On Structural Parameterizations of Star Coloring
A star coloring of a graph G is a proper vertex coloring such that every path on four vertices uses at least three distinct colors. The minimum...
-
Computational Aspects of Double Dominating Sequences in Graphs
In a graph \(G=(V,E)\) , a vertex...
-
Algorithms and Complexity of Strongly Stable Non-crossing Matchings
A matching is called stable if it has no blocking pair, where a blocking pair is a man-woman pair, say (m, w), such that m and w are not matched with...
-
On Locally Identifying Coloring of Graphs
A proper coloring of a graph G is said to be locally identifying coloring (lid-coloring for short), if for every pair of adjacent vertices u and v...
-
Monitoring Edge-Geodetic Sets in Graphs
We introduce a new graph-theoretic concept in the area of network monitoring. In this area, one wishes to monitor the vertices and/or the edges of a...
-
Cyclability, Connectivity and Circumference
In a graph G, a subset of vertices \(S \subseteq V(G)\)...
-
Transitivity on Subclasses of Chordal Graphs
Let \(G=(V, E)\) be a graph, where V and E are...
-
Diverse Fair Allocations: Complexity and Algorithms
In this work, we initiate the study of diversity of solutions in the context of fair division of indivisible goods. In particular, we explore the...
-
5-List Coloring Toroidal 6-Regular Triangulations in Linear Time
We give an explicit procedure for 5-list coloring a large class of toroidal 6-regular triangulations in linear time. We also show that these graphs...
-
Graph Covering Using Bounded Size Subgraphs
A variant of graph covering problem demands to find a set of sub-graphs when the union of sub-graphs contain all the edges of G. Another variant of...
-
Axiomatic Characterization of the Toll Walk Function of Some Graph Classes
A toll walk \(W=w_1\dots w_k\) in a graph G is...