|
|
|
|
|
Agostinho Agra and Jose Maria Samuco
Given a social network modelled by a graph, the goal of the influence maximization problem is to find k vertices that maximize the number of active vertices through a process of diffusion. For this diffusion, the linear threshold model is considered. A n...
ver más
|
|
|
|
|
|
|
|
|
|
|
Konstantinos Gratsos , Stefanos Ougiaroglou and Dionisis Margaris
Partition-based clustering is widely applied over diverse domains. Researchers and practitioners from various scientific disciplines engage with partition-based algorithms relying on specialized software or programming libraries. Addressing the need to b...
ver más
|
|
|
|
|
|
|
|
|
|
|
Shalini Sharma and Jerry Chou
In time-evolving graphs, the graph changes at each time interval, and the previously computed results become invalid. We addressed this issue for the traveling salesman problem (TSP) in our previous work and proposed an incremental algorithm where the TS...
ver más
|
|
|
|
|
|
|
|
|
|
|
Mohammad Daradkeh
The heterogeneity and diversity of users and external knowledge resources is a hallmark of open innovation communities (OICs). Although user segmentation in heterogeneous OICs is a prominent and recurring issue, it has received limited attention in open ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Faiza Riaz Khawaja, Jinfang Sheng, Bin Wang and Yumna Memon
Community detection, also known as graph clustering, in multi-layer networks has been extensively studied in the literature. The goal of community detection is to partition vertices in a network into densely connected components so called communities. Ne...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yulia Terentyeva
Pág. 23 - 27
The article discusses the issue of restoring the connectivity of a communication network in the case of its fragmentation with a certain criterion of optimality. As an optimality criterion, the total length of the edges being completed is taken, the weig...
ver más
|
|
|
|
|
|
|
|
|
|
|
Agus Irawan, Asmiati Asmiati, La Zakaria and Kurnia Muludi
The locating-chromatic number of a graph combines two graph concepts, namely coloring vertices and partition dimension of a graph. The locating-chromatic number is the smallest k such that G has a locating k-coloring, denoted by ????(??)
?
L
(
G
)
. This...
ver más
|
|
|
|
|
|
|
|
|
|
|
Fabio Sikansi, Renato R. O. da Silva, Gabriel D. Cantareira, Elham Etemad and Fernando V. Paulovich
Graph visualization has been successfully applied in a wide range of problems and applications. Although different approaches are available to create visual representations, most of them suffer from clutter when faced with many nodes and/or edges. Among ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Michael Hamann and Ben Strasser
We present a mapping between rooted tree decompositions and node separator based multilevel graph partitions. Significant research into both tree decompositions and graph partitions exists. We hope that our result allows for an easier knowledge transfer ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Xiangyu Long, Shufan Wu, Xiaofeng Wu, Yixin Huang and Zhongcheng Mu
This paper presents a space mission planning tool, which was developed for LEO (Low Earth Orbit) observation satellites. The tool is focused on a two-phase planning strategy with clustering preprocessing and mission planning, where an improved clustering...
ver más
|
|
|
|
|
|