A novel framework called Graph diffusion & PCA (GDPCA) is proposed in the context of semi-supervised learning on graph structured data. It combines a modified Principal Component Analysis with classical supervised loss and Laplacian regularization, thus handling case where adjacency matrix Sparse avoiding Curse dimensionality. Our can be applied to non-graph datasets as well, such images by con...

Non-stationarity is ubiquitous in human behavior and addressing it the contextual bandits challenging. Several works have addressed problem by investigating semi-parametric warned that ignoring non-stationarity could harm performances. Another prevalent social interaction which has become available a form of network or graph structure. As result, graph-based received much attention. In this pap...

The semi-random graph process is a single player game in which the initially presented an empty on n vertices. In each round, vertex u to independently and uniformly at random. then adaptively selects v, adds edge uv graph. For fixed monotone property, objective of force satisfy this property with high probability as few rounds possible. We focus problem constructing Hamilton cycle particular, ...

Graph convolutional networks learn effective node embeddings that have proven to be useful in achieving high-accuracy prediction results semi-supervised learning tasks, such as classification. However, these suffer from the issue of over-smoothing and shrinking effect graph due large part fact they diffuse features across edges using a linear Laplacian flow. This limitation is especially proble...

Let G(p, q) be a connected graph and Mv (G) its corresponding vertex semi middle graph. A dominating set D⊆V[Mv (G)] is Nonsplit 〈V[Mv (G)]-D〉 connected. The minimum size of D called the domination number denoted by γns [Mv (G)]. In this paper we obtain several results on number.

a set $s$ of vertices in a graph $g=(v,e)$ is called a total$k$-distance dominating set if every vertex in $v$ is withindistance $k$ of a vertex in $s$. a graph $g$ is total $k$-distancedomination-critical if $gamma_{t}^{k} (g - x) < gamma_{t}^{k}(g)$ for any vertex $xin v(g)$. in this paper,we investigate some results on total $k$-distance domination-critical of graphs.

In this paper, we develop semi-external and external memory algorithms for graph partitioning and clustering problems. Graph partitioning and clustering are key tools for processing and analyzing large complex networks. We address both problems in the (semi-)external model by adapting the size-constrained label propagation technique. Our (semi-)external size-constrained label propagation algori...

Assembly line balancing problems (ALBP) consist in assigning the total workload for manufacturing a product to stations of an assembly line as typically applied in automotive industry. The distribution of the tasks to the stations is due to restrictions which can be expressed in a precedence graph. However, automotive manufacturers usually do not know complete precedence graphs describing the p...