Wyszukiwarka
Wyniki wyszukiwania dla: OPTIMIZATION ALGORITHM
-
Computational aspects of greedy partitioning of graphs
PublikacjaIn this paper we consider a variant of graph partitioning consisting in partitioning the vertex set of a graph into the minimum number of sets such that each of them induces a graph in hereditary class of graphs P (the problem is also known as P-coloring). We focus on the computational complexity of several problems related to greedy partitioning. In particular, we show that given a graph G and an integer k deciding if the greedy...
-
Paired domination versus domination and packing number in graphs
PublikacjaGiven a graph G = (V(G), E(G)), the size of a minimum dominating set, minimum paired dominating set, and a minimum total dominating set of a graph G are denoted by γ (G), γpr(G), and γt(G), respectively. For a positive integer k, a k-packing in G is a set S ⊆ V(G) such that for every pair of distinct vertices u and v in S, the distance between u and v is at least k + 1. The k-packing number is the order of a largest kpacking and...
-
Design and Analysis of Artificial Neural Network (ANN) Models for Achieving Self-Sustainability in Sanitation
PublikacjaThe present study investigates the potential of using fecal ash as an adsorbent and demonstrates a self-sustaining, optimized approach for urea recovery from wastewater streams. Fecal ash was prepared by heating synthetic feces to 500 °C and then processing it as an adsorbent for urea adsorption from synthetic urine. Since this adsorption approach based on fecal ash is a promising alternative for wastewater treatment, it increases...