New benchmarks for large-scale networks with given maximum degree and diameter /

שמור ב:

מידע ביבליוגרפי
מחבר ראשי:	Loz, Eyal.
מחברים אחרים:	Pineda-Villavicencio, Guillermo.
פורמט:	Bài viết
שפה:	English
נושאים:	Cayley graphs Diameter problem Graph compounding Kronecker product Large-scale networks Moore bound Moore graphs Polarity graphs Small-world networks Vertex duplication Voltage assignment Voltage graphs
תגים:	הוספת תג אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!

Thư viện lưu trữ:	Thư viện Trường Đại học Đà Lạt


LEADER	01155nam a2200385 4500
001	DLU110129937
005	##20111223
040	#	#	\|a DLU \|b eng
041	#	#	\|a eng
044	#	#	\|a uk
100	#	#	\|a Loz, Eyal.
245	#	#	\|a New benchmarks for large-scale networks with given maximum degree and diameter / \|c Eyal Loz, Guillermo Pineda-Villavicencio.
653	#	#	\|a Cayley graphs
653	#	#	\|a Diameter problem
653	#	#	\|a Graph compounding
653	#	#	\|a Kronecker product
653	#	#	\|a Large-scale networks
653	#	#	\|a Moore bound
653	#	#	\|a Moore graphs
653	#	#	\|a Polarity graphs
653	#	#	\|a Small-world networks
653	#	#	\|a Vertex duplication
653	#	#	\|a Voltage assignment
653	#	#	\|a Voltage graphs
700	#	#	\|a Pineda-Villavicencio, Guillermo.
773	#	#	\|t The Computer Journal \|g Vol. 53, no. 7 (September 2010), p. 1092-1105
920	#	#	\|a Phòng Tạp chí -- Trung tâm Thông tin - Thư viện Trường Đại học Đà Lạt
994	#	#	\|a DLU
900	#	#	\|a True
911	#	#	\|a Trương Bảo Trâm Anh
925	#	#	\|a G
926	#	#	\|a A
927	#	#	\|a BB
980	#	#	\|a Thư viện Trường Đại học Đà Lạt

פריטים דומים