One-to-one disjoint path covers on k-ary n-cubes

Title
One-to-one disjoint path covers on k-ary n-cubes
Authors
Keywords
-
Journal
THEORETICAL COMPUTER SCIENCE
Volume 412, Issue 35, Pages 4513-4530
Publisher
Elsevier BV
Online
2011-05-03
DOI
10.1016/j.tcs.2011.04.035

Ask authors/readers for more resources

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now