Open Problems in the Construction of Large Directed Graphs

Please use this identifier to cite or link to this item: https://repository.unej.ac.id/xmlui/handle/123456789/58764

Full metadata record

DC Field	Value	Language
dc.contributor.author	Dafik, Mirka Miller, Joe Ryan, Slamin	-
dc.date.accessioned	2014-08-10T14:27:13Z	-
dc.date.available	2014-08-10T14:27:13Z	-
dc.date.issued	2005-09-15	-
dc.identifier.citation	The Construction of Large Directed Graphs	en_US
dc.identifier.isbn	0-646-45252-5	-
dc.identifier.uri	http://repository.unej.ac.id/handle/123456789/58764	-
dc.description	This research topic is a part of extremal graph	en_US
dc.description.abstract	In this paper we consider the problem of how to construct directed graphs with given maximum out-degree and diameter. To deal with this problem, we describe several construction techniques. These fall into three broad categories, namely, algebraic specification, expansion and reduction methods.	en_US
dc.description.sponsorship	AUSTRALIAN RESEARCH COUNCIL GRANT 2005-2007	en_US
dc.language.iso	en_US	en_US
dc.publisher	Proceedings of the sixteenth Australasian Workshop on Combinatorial Algoritms	en_US
dc.relation.ispartofseries	AWOCA;16	-
dc.subject	Construction techniques, large order of directed graphs, degree, diameter.	en_US
dc.title	Open Problems in the Construction of Large Directed Graphs	en_US
dc.title.alternative	Masalah terbuka dalam konstruksi graf berarah besar	en_US
dc.type	Article	en_US
Appears in Collections:	MIPA

Files in This Item:

File	Size	Format
Open Problems in the Construction of Large Directed Graphs.pdf	2.08 MB	Adobe PDF	View/Open

DSpace JSPUI