Wide diameters of de Bruijn graphs

Full metadata record

DC Field	Value	Language
dc.contributor.author	Kuo, Jyhmin	en_US
dc.contributor.author	Fu, Hung-Lin	en_US
dc.date.accessioned	2014-12-08T15:05:27Z	-
dc.date.available	2014-12-08T15:05:27Z	-
dc.date.issued	2007-10-01	en_US
dc.identifier.issn	1382-6905	en_US
dc.identifier.uri	http://dx.doi.org/10.1007/s10878-007-9066-4	en_US
dc.identifier.uri	http://hdl.handle.net/11536/3996	-
dc.description.abstract	The wide diameter of a graph is an important parameter to measure fault-tolerance of interconnection network. This paper proves that for any two vertices in de Bruijn undirected graph UB(d,n), there are 2d-2 internally disjoint paths of length at most 2n+1. Therefore, the (2d-2)-wide diameter of UB(d,n) is not greater than 2n+1.	en_US
dc.language.iso	en_US	en_US
dc.subject	de Bruijn	en_US
dc.subject	internally disjoint path	en_US
dc.subject	wide diameter	en_US
dc.title	Wide diameters of de Bruijn graphs	en_US
dc.type	Article; Proceedings Paper	en_US
dc.identifier.doi	10.1007/s10878-007-9066-4	en_US
dc.identifier.journal	JOURNAL OF COMBINATORIAL OPTIMIZATION	en_US
dc.citation.volume	14	en_US
dc.citation.issue	2-3	en_US
dc.citation.spage	143	en_US
dc.citation.epage	152	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:000248864800005	-
Appears in Collections:	Conferences Paper

Files in This Item:

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.