https://doi.org/10.1002/(sici)1097-0118(199906)31:2<101::aid-jgt3>3.3.co;2-x ...
A signed bipartite graph G(U,V) is a bipartite graph in which each edge is assigned a positive or a negative sign. The signed degree of a vertex x in G(U, V) is the number of positive edges incident ...
Abstract: Clustering based on structured graph learning involves acquiring a proximity matrix with an explicit clustering structure from the original one. However, the original proximity matrix often ...
Gallai–Ramsey theory lies at the intersection of graph colouring and Ramsey theory, providing a framework for understanding how structures emerge in edge-coloured graphs. Central to this domain is the ...
This is a preview. Log in through your library . Abstract This paper investigates the group testing problem in graphs as follows. Given a graph G = (V, E), determine the minimum number t(G) such that ...
Abstract: This paper introduces Localized Bipartite Match Graph Attention Q-Learning (BMG-Q), a novel Multi-Agent Reinforcement Learning (MARL) algorithm framework tailored for ride-pooling order ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results