On the complexity of digraph packings

This article is hosted on another website.

You may be required to register, activate a subscription or purchase the article before you can obtain the full text.

Proceed

Download / Buy Article:

Keywords: Computational complexity; Graph algorithms; Graph packings

Document Type: Short Communication

DOI: http://dx.doi.org/10.1016/S0020-0190(02)00478-7

Affiliations: 2Financial support from project TMR-DONET nr. ERB FMRX-CT98-0202 of the European Community.Computer Science Department, Bishop's University, , Quebec, , J1M 1Z7, Lennoxville, Canada

Publication date: April 30, 2003

Related content

Tools

Favourites

Share Content

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
X
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more