เปรียบเทียบวิธี

	ค่าความเป็นศูนย์กลางแบบผ่านกลางตามเวลา	Directed Betweenness Centrality
สาขาวิชา	การวิเคราะห์เครือข่าย	การวิเคราะห์เครือข่าย
ตระกูล	Machine learning	Machine learning
ปีกำเนิด	2012	1977
ผู้ริเริ่ม	Kim, H. & Anderson, R.; Holme, P. & Saramäki, J.	Freeman, L. C.
ประเภท	Centrality measure for temporal networks	Centrality measure (directed graph)
แหล่งต้นตำรับ	Holme, P., & Saramäki, J. (2012). Temporal networks. Physics Reports, 519(3), 97–125.	Freeman, L. C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40(1), 35–41.
ชื่อเรียกอื่น	TBC, time-varying betweenness centrality, dynamic betweenness centrality, time-respecting betweenness	directed BC, digraph betweenness, asymmetric betweenness centrality, directed Freeman betweenness
ที่เกี่ยวข้อง	6	5
สรุป	Temporal Betweenness Centrality (TBC) extends classical betweenness centrality to time-stamped networks by counting how often a node lies on time-respecting shortest paths — paths that traverse edges in chronological order. It identifies nodes that act as temporal brokers, controlling information or resource flow as it evolves over time, rather than in a static snapshot.	Directed Betweenness Centrality extends Freeman's classic betweenness measure to directed graphs, quantifying how often a node lies on the shortest directed paths between all other pairs of nodes. It identifies gatekeepers, brokers, and bottlenecks in asymmetric flows such as information cascades, citation networks, and organizational hierarchies.