Two Algorithms for Three Dimensional Orthogonal Graph Drawing

Eades, P; Symvonis, A; Whitesides, S

dc.contributor.author	Eades, P	en
dc.contributor.author	Symvonis, A	en
dc.contributor.author	Whitesides, S	en
dc.date.accessioned	2014-03-01T02:48:23Z
dc.date.available	2014-03-01T02:48:23Z
dc.date.issued	1996	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33782
dc.relation.uri	http://www.springerlink.com/content/b86w00q51874p773	en
dc.relation.uri	http://www.springerlink.com/index/b86w00q51874p773.pdf	en
dc.relation.uri	http://www.informatik.uni-trier.de/~ley/db/conf/gd/gd1996.html#EadesSW96	en
dc.subject	Graph Drawing	en
dc.subject	Graph Theory	en
dc.subject	Maximum Degree	en
dc.subject	Three Dimensional	en
dc.subject	3 dimensional	en
dc.title	Two Algorithms for Three Dimensional Orthogonal Graph Drawing	en
heal.type	conferenceItem	en
heal.publicationDate	1996	en
heal.journalName	Symposium on Graph Drawing	en