云南高校图书馆联盟文献共享服务平台- MULTIGRAPH

检索规则说明：AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：范例一： (K=图书馆学 OR K=情报学) AND A=范并思　　　　范例二：J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual

全部期刊核心期刊 EI来源期刊 SCI来源期刊 CA来源期刊 CSCD来源期刊 CSSCI来源期刊

Kinematics-aware multigraph attention network with residual learning for heterogeneous trajectory prediction: 《Journal of Intelligent and Connected Vehicles》2024年第2期138-150,共13页Zihao Sheng Zilin Huang Sikai Chen; the University of Wisconsin-Madison’s Center for Connected and Automated Transportation(CCAT),a part of the larger CCAT consortium,a USDOT Region 5 University Transportation Center funded by the U.S.Department of Transportation,Award#69A3552348305.; Trajectory prediction for heterogeneous traffic agents plays a crucial role in ensuring the safety and efficiency of automated driving in highly interactive traffic environments.Numerous studies in this area have focu...; 关键词：trajectory prediction physics-informed deep learning multigraph attention residual learning automated driving

Extracting multi-objective multigraph features for the shortest path cost prediction:Statistics-based or learning-based?: 《Green Energy and Intelligent Transportation》2024年第1期1-15,共15页Songwei Liu Xinwei Wang Michal Weiszer Jun Chen; This work was supported by the UK Engineering and Physical Sciences Research Council(grant no.EP/N029496/1,EP/N029496/2,EP/N029356/1,EP/N029577/1,and EP/N029577/2);the joint scholarship of the China Scholarship Council and Queen Mary,University of London(grant no.202006830015).; Efficient airport airside ground movement(AAGM)is key to successful operations of urban air mobility.Recent studies have introduced the use of multi-objective multigraphs(MOMGs)as the conceptual prototype to formulate...; 关键词：Multi-objective multigraph Feature extraction Shortest path cost prediction Node patterns Node embeddings Regression

Star-factorization of the Complete Bipartite Multigraphs: 《Acta Mathematicae Applicatae Sinica》2023年第2期239-248,共10页Jing SHI Jian WANG Bei-liang DU; supported by the National Natural Science Foundation of China (Grant No.K110703711)。; LetλK_(m,n)be a complete bipartite multigraph with two partite sets having m and n vertices,respectively.A K_(p,q)-factorization ofλK_(m,n)is a set of K_(p,q)-factors ofλK_(m,n)which partition the set of edges ofλ...; 关键词：complete bipartite multigraph STAR FACTORIZATION

Pythagorean Neutrosophic Planar Graphs with an Application in Decision-Making被引量：1: 《Computers, Materials & Continua》2023年第6期4935-4953,共19页P.Chellamani D.Ajay Mohammed M.Al-Shamiri Rashad Ismail; The authors extend their appreciation to the Deanship of Scientific Research at King Khalid University for funding this work through the Large Group Research Project under grant number(R.G.P.2/181/44).; Graph theory has a significant impact and is crucial in the structure of many real-life situations.To simulate uncertainty and ambiguity,many extensions of graph theoretical notions were created.Planar graphs play a v...; 关键词：Pythagorean neutrosophic planar graph planarity value ISOMORPHISM dual graphs MULTIGRAPH

{Ck, Pk, Sk} -Decompositions of Balanced Complete Bipartite Multigraphs: 《Open Journal of Discrete Mathematics》2016年第3期174-179,共7页Jenq-Jong Lin Min-Jen Jou; Let be a family of subgraphs of a graph G. An L-decomposition of G is an edge-disjoint decomposition of G into positive integer copies of H_i, where . Let C_k, P_k and S_k denot...; 关键词：Balanced Complete Bipartite Multigraph Cycle Path Star Decomposition

On K_(1,k)-factorization of bipartite multigraphs: 《Applied Mathematics(A Journal of Chinese Universities)》2008年第3期345-350,共6页WANG Jian; the National Natural Science Foundation of China (10571133); A K1,k-factorization of λKm,n is a set of edge-disjoint K1,k-factors of λKm,n, which partition the set of edges of λKm,n. In this paper, it is proved that a sufficient condition for the existence of K1,k-factorizat...; 关键词：FACTOR FACTORIZATION bipartite multigraph

The spectrum of path factorization of bipartite multigraphs: 《Science China Mathematics》2007年第7期1045-1054,共10页Jian WANG~1 Bei-liang DU~(2+) 1 Nantong Vocational College,Nantong 226007,China 2 Department of Mathematics,Suzhou University,Suzhou 215006,China; This work was supported by the National Natural Science Foundation of China(Grant No.10571133).; Let λK m,n be a bipartite multigraph with two partite sets having m and n vertices, respectively. A P v-factorization of λK m,n is a set of edge-disjoint P v-factors of λK m,n which partition the set of edges of λ...; 关键词：bipartite multigraph FACTORIZATION 05B30 05C70

P_(4k-1)-factorization of bipartite multigraphs被引量：1: 《Science China Mathematics》2006年第7期961-970,共10页WANG Jian & DU Beiliang Nantong Vocational College, Nantong 226007, China Department of Mathematics, Suzhou University, Suzhou 215006, China; This work was supported by the National Natural Science Foundation of China (Grant No. 10571133).; LetλKm,n be a bipartite multigraph with two partite sets having m and n vertices, respectively. A Pν-factorization ofλKm,n is a set of edge-disjoint Pν-factors ofλKm,n which partition the set of edges ofλKm,n. W...; 关键词：BIPARTITE multigraph factor factorization.

LOWER BOUNDS ON THE MAXIMUM GENUS OF LOOPLESS MULTIGRAPHS被引量：1: 《Applied Mathematics(A Journal of Chinese Universities)》2000年第4期359-368,共10页LiDeming LiuYanpei; The lower bounds on the maximum genus of loopless graphs are obtained according to the connectivity of these graphs. This not only answers a question of Chen, Archdeacon and Gross, but also generalizes the previous kn...; 关键词：Maximum genus lower bound multigraph.

A TIGHT LOWER BOUND ON THE MAXIMUM GENUS OF A 3-CONNECTED LOOPLESS MULTIGRAPH被引量：1: 《Applied Mathematics(A Journal of Chinese Universities)》2000年第4期369-376,共8页LiDeming LiuYanpei; It is proved that every 3 connected loopless multigraph has maximum genus at least one third of its cycle rank plus one if its cycle rank is not less than ten, and if its cycle rank is less than ten,it is upper emb...; 关键词：Maximum genus GRAPH connectivity.

MULTIGRAPH