Your Location：
Home >
Browse articles >
T2T Resource Allocation Algorithm for High-Speed Railways Based on Weighted Bipartite Graph-Stackelberg Game
T2T Resource Allocation Algorithm for High-Speed Railways Based on Weighted Bipartite Graph-Stackelberg Game
- Railway Standard Design Vol. 70, Issue 10, Pages: 192-200(2026)
DOI： 10.13238/j.issn.1004-2954.202411060004
Revised：2025-01-22
Scan QR Code
Full Text(HTML)
Figs( 38 ) Tabs( 0 )
References
Publication Info
Metrics
14
Views
12
Downloads
0
CSCD
Alert me when the article has been cited
Submit
Tools
- BibTeXDownload
- EndnoteDownload
- RefMan Download
- NoteExpressDownload
- NoteFirstDownload
Related Articles
Resource Allocation Algorithm for Train-to-Train Communication Based on Dinkelbach and BKM
T2T（Train to Train） Communication Resource Allocation Algorithm Based on D2D
Research on Networking Technologies for Smooth Evolution of Dispatching Communication from GSM-R to 5G-R
Research on Business Requirement Analysis and Implementation Scheme of Intelligent Network Services Based on 5G-R
Design of QoS Negotiation and Service Process for 5G-R Dispatching Communication
Related Author
WANG Ruifeng
HUANG Ziheng
ZHOU Qing-hua
HU Xue-yang
SHI Bo
GUO Liang
CHEN Lyu
ZHANG Xindan
Related Institution
中国铁道科学研究院研究生部，北京 100081Postgraduate Department, China Academy of Railway Sciences, Beijing 100081, China
中国铁道科学研究院集团有限公司通信信号研究所，北京 100081Signal and Communication Research Institute, China Academy of Railway Sciences Corporation Limited, Beijing 100081, China
国家铁路智能运输系统工程技术研究中心，北京 100081The Center of National Railway Intelligent Transportation System Engineering and Technology, Beijing 100081, China
National Research Center of Railway Intelligence Transportation System Engineering Technology
Signal and Communication Research Institute, China Academy of Railway Sciences Corporation Limited
