DATA STRUCTURE FOR GRAPH REPRESENTATIONS OF A NETWORK HAVING DOUBLE EULER TRAILS

dc.citation.epage	442	en_US
dc.citation.spage	436	en_US
dc.citation.volume	12	en_US
dc.citation.woscount	0
dc.contributor.author	SUNG, TY	en_US
dc.contributor.author	HSU, LH	en_US
dc.contributor.author	HWANG, JY	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.date.accessioned	2014-12-08T15:05:04Z
dc.date.available	2014-12-08T15:05:04Z
dc.date.issued	1992	en_US
dc.description.abstract	A network that has a double Euler trail (DET) is called a DET network. A DET network may realize various DETs in different graph representations. Furthermore, a pair of specific graph representations for a DET network may realize different DETs. Based on above considerations, we introduce a data structure PQQ'-tree to keep DETs in all graph representations for any DET network.	en_US
dc.identifier.issn	0926-5473	en_US
dc.identifier.journal	IFIP TRANSACTIONS A-COMPUTER SCIENCE AND TECHNOLOGY	en_US
dc.identifier.uri	https://ir.lib.nycu.edu.tw/handle/11536/3598
dc.identifier.wosnumber	WOS:A1992KV27500058
dc.language.iso	en_US	en_US
dc.title	DATA STRUCTURE FOR GRAPH REPRESENTATIONS OF A NETWORK HAVING DOUBLE EULER TRAILS	en_US
dc.type	Article	en_US

Files

Now showing 1 - 1 of 1