EEMCS EPrints Service

Education

Research

Prospective Students

Jobs

Publications

Intranet (internal)

Nederlands

Contact

Sitemap

Organisation

1219 An Algorithm for Generating Node Disjoint Routes in Kautz Digraphs

Home Policy Brochure Browse Search User Area Contact Help

Smit, G.J.M. and Havinga, P.J.M. and Jansen, P.G. (1991) An Algorithm for Generating Node Disjoint Routes in Kautz Digraphs. In: 5th Int. Parallel Processing Symp., Anaheim, California. pp. 102-107. IEEE Computer Society. ISBN 0-8186-9167-0

Full text not available from this repository.

Official URL: http://doi.ieeecomputersociety.org/10.1109/IPPS.1991.153763

Item Type:	Conference or Workshop Paper (Proceedings UNSPECIFIED, Presentation Type UNSPECIFIED)
Research Group:	EWI-DIES: Distributed and Embedded Security, EWI-CAES: Computer Architecture for Embedded Systems
Research Program:	CTIT-UBRICKS: Building Blocks for Ubiquitous Computing and Communication
Additional Information:	Imported from DIES
ID Code:	1219
Status:	Published
Deposited On:	12 December 2005
Refereed:	Yes
International:	Yes
More Information:	statistics

Export this item as:

To correct this item please ask your editor

Repository Staff Only: edit this item