Characterization and recognition of edge intersection graphs of trichromatic hypergraphs with finite multiplicity in the class of split graphs by T. V. Lubasheva

“…The complexity of the recognition of graphs from Lm(k) for fixed k ≥ 2 and m ≥ 2 is currently unknown.A split graph is a graph whose vertices can be partitioned into a clique and an independent set. …”
Get full text

Some complexity results on semipaired domination in graphs by Vikash Tripathi, Kusum, Arti Pandey

“…In this article, we resolve the complexity of the problem in two well studied graph classes, namely, AT-free graphs and planar graphs. …”
Get full text

Spectral Complexity of Directed Graphs and Application to Structural Decomposition by Igor Mezić, Vladimir A. Fonoberov, Maria Fonoberova, Tuhin Sahai

“…We introduce a new measure of complexity (called spectral complexity) for directed graphs. …”
Get full text

Siamese Graph Convolutional Split-Attention Network with NLP based Social Sentimental Data for enhanced stock price predictions by Jayaraman Kumarappan, Elakkiya Rajasekar, Subramaniyaswamy Vairavasundaram, Ketan Kotecha, Ambarish Kulkarni

“…To address these challenges, this paper proposes a new method called Siagra-ConSA-HSOA (Siamese Graph Convolutional Split-Attention Network with NLP-based Social Sentiment Data). …”
Get full text

Self-Supervised Neural Networks for Precoding in MIMO Rate Splitting Multiple Access Systems by Dheeraj Raja Kumar, Carles Anton-Haro, Xavier Mestre

“…In this paper, we investigate the use of self-supervised data-driven schemes for precoder optimization in the downlink of a Multiple-Input Multiple-Output (MIMO) Rate Splitting Multiple Access (RSMA) system. Specifically, we propose two architectures based on Graph Neural Networks (GNN) and the Multi-Layer Perceptron (MLP) respectively, and analyze their achievable sum-rate performance in the underloaded and critically-loaded regime as the system scales up. …”
Get full text

On Some families of Path-related graphs with their edge metric dimension by Lianglin Li, Shu Bao, Hassan Raza

“…In this paper, the edge metric dimension of some path-related graphs is computed, namely, the middle graph of path M(Pn) and the splitting graph of path S(Pn).…”
Get full text

On $[1,2]$-Domination in Interval and Circle Graphs by Mohsen Alambardar Meybodi, Abolfazl Poureidi

“…A polynomial-time algorithm was obtained in split graphs for a constant $j$ in contrast to the Dominating Set problem which is NP-hard for split graphs. …”
Get full text

Bounds and complexity results of rainbow vertex-disconnection colorings by Yindi Weng

Get full text

Perfect Roman {3}-Domination in Graphs: Complexity and Bound of Perfect Roman {3}-Domination Number of Trees by Ahlam Almulhim

Get full text

Perfect Roman Domination: Aspects of Enumeration and Parameterization by Kevin Mann, Henning Fernau

“…For instance, split graphs are the first graph class for which <span style="font-variant: small-caps;">Unique Response</span> <span style="font-variant: small-caps;">Roman Domination</span> is polynomial-time solvable, while <span style="font-variant: small-caps;">Perfect Roman Domination</span> is NP-complete. …”
Get full text

Auxo: A Temporal Graph Management System by Wentao Han, Kaiwei Li, Shimin Chen, Wenguang Chen

“…Second, graph splitting further improves the worst-case query time, and reduces the performance variance introduced by splitting operations. …”
Get full text

Competing all-pairs shortest paths algorithms for sparse / dense graphs: implementation and comparison by A. A. Prihozhy, O. N. Karasik

“…It is known that in terms of computational complexity, the first algorithm is preferable on sparse graphs and the second algorithm is preferable on dense graphs. …”
Get full text

LMGD: Log-Metric Combined Microservice Anomaly Detection Through Graph-Based Deep Learning by Xu Liu, Yuewen Liu, Miaomiao Wei, Peng Xu

“…Due to their complexity and large scale, microservice systems are typically fragile and failures are inevitable. …”
Get full text

Enhancing basal cell carcinoma classification in preoperative biopsies via transfer learning with weakly supervised graph transformers by Johan Björkman, Sigrid Lagerroth, Jan Siarov, Filmon Yacob, Noora Neittaanmäki

“…Features were formed into graphs for spatial information and the processed by a Vision Transformer. …”
Get full text

EDG-Net: Edge-Enhanced Dynamic Graph Convolutional Network for Remote Sensing Scene Classification of Mining-Disturbed Land by Xianju Li, Pan Kong, Weitao Chen, Wenxi He, Jian Feng, Jiangyuan Wang

“…Subsequently, a novel model of edge-enhanced dynamic graph convolutional network (GCN) (EDG-Net) was proposed to learn the discriminative features for classification of mining land with irregular edges, different sizes, a relatively small proportion, and sparse spatial distribution. (1) Edge-enhanced multiscale attention module: it is designed to capture key multiscale features and edge details using parallel dilated convolutions with attention fusion and edge enhancement, which facilitates the identification of objects with irregular edges and different sizes. (2) Downsampling fusion module: it integrates the features obtained through spatially split learning and max-pooling to overcome the information loss issue of small objects. (3) Patch-based dynamic GCN: the input images were split into several patches as nodes, and a graph was constructed and dynamically updated by connecting the nearest neighbors. …”
Get full text

Methodological development study: Dynamic mask attention graph neural network for mechanical ventilation in elderly intensive care unit patients by Yi Xie, Ni Xie, Jiao Guo

“…The intubation prediction task was formulated using a sliding window with a strict temporal data split to avoid data leakage. We propose a dynamic mask attention graph neural network (DymaGNN) to capture the time-varying relationship of key physiological variables by constructing a dynamic heterogeneous graph structure and an adaptive edge-weighting mechanism. …”
Get full text

Heuristic optimization in classification atoms in molecules using GCN via uniform simulated annealing by Agnieszka Polowczyk, Alicja Polowczyk, Marcin Woźniak

“…Abstract Graph neural networks are becoming increasingly popular in deep learning due to their ability to process data in irregular structures and graphs thus preserving additional spatial dependencies due to the arrangement of nodes. …”
Get full text

A throughput and priority optimization strategy for high density healthcare IoT by Zhenlang Su, Junyu Ren, Yeheng Huang, Yang Liao, Tuanfa Qin

“…Firstly, the complex interference problem among WBANs is converted into a distance-based graph coloring model, then time division multiple access and a two-level split clustering methods are adopted to allocate initial time slots for nodes. …”
Get full text

Prioritization and Ranking of Phases for the Management of the Construction Project of the LNG Plant Production Line by R. Yu. Dashkov

“…To achieve this goal, the following tasks must be solved in the article: identify the phases of the project at the planning stage that affect the Final Investment Decision (FID); draw up a reachability matrix that defines the interrelations between the phases of the project; split the phases of the project into hierarchical levels; construct a directed graph model and a diagram of the degree of influence and coherence of the project phases facilitating the adoption of strategic management decisions and the coordination of internal and external stakeholders. …”
Get full text

An improved density peaks clustering algorithm by automatic determination of cluster centres by Hui Du, Yanting Hao, Zhihe Wang

“…However, this manual selection is difficult for larger and more complex datasets, and it is easy to split a cluster into multiple subclusters. …”
Get full text