Over the last two decades, significant advances have been made in the design and analysis
of fixed-parameter algorithms for a wide variety of graphtheoretic problems. This has …

Session-based recommendation plays an important role in daily life and exists in many
scenarios, such as online shop** websites and streaming media platforms. Recently …

Toward better approximation for the minimum-weighted vertex cover (MWVC) problem in
multiagent systems, we present a distributed algorithm from the perspective of learning in …

Computing maximum weight independent sets in graphs is an important NP-hard
optimization problem. The problem is particularly difficult to solve in large graphs for which …

Wireless ad hoc networks (WANETs) are infrastructureless networks and are used in various
applications such as habitat monitoring, military surveillance, and disaster relief. Data …

Abstract Information technologies, such as building information modeling (BIM), significantly
improve the clash detection process, but the clash resolution process is still time consuming …

Graph neural networks (GNNs) have found widespread application in modeling graph data
across diverse domains. While GNNs excel in scenarios where the testing data shares the …

The minimum weight vertex cover problem (MWVCP) is a fundamental combinatorial
optimization problem with various real-world applications. The MWVCP seeks a vertex cover …

Purpose Maximum k vertex cover problem is a significant combinatorial optimization
problem with various applications, such as transportation planning, social networks and …

Over the last two decades, significant advances have been made in the design and analysis
of fixed-parameter algorithms for a wide variety of graph-theoretic problems. This has …