Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 89, 2012 - Issue 5
Submit an article Journal homepage
85
Views
10
CrossRef citations to date
0
Altmetric
Section A

General-demand disjoint path covers in a graph with faulty elements

Jae-Ha Lee Department of Computer Science and Engineering, Konkuk University, Seoul, 143-701, South Korea
&
Jung-Heum Park School of Computer Science and Information Engineering, The Catholic University of Korea, Bucheon, 420-743, South KoreaCorrespondence[email protected]
Pages 606-617 | Received 13 Jul 2011, Accepted 09 Jan 2012, Published online: 13 Feb 2012

Citations (10)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (2)

Jing Li, Di Liu, Yuxing Yang & Jun Yuan. (2015) One-to-one disjoint path covers on multi-dimensional tori. International Journal of Computer Mathematics 92:6, pages 1114-1123.
Read now
Hyeong-Seok Lim, Jung-Heum Park & Hee-Chul Kim. (2015) The bicube: an interconnection of two hypercubes. International Journal of Computer Mathematics 92:1, pages 29-40.
Read now

Articles from other publishers (8)

Jung-Heum Park. (2021) A sufficient condition for the unpaired k-disjoint path coverability of interval graphs. The Journal of Supercomputing 77:7, pages 6871-6888.
Crossref
Jung-Heum Park & Hyeong-Seok Lim. (2020) Characterization of interval graphs that are unpaired 2-disjoint path coverable. Theoretical Computer Science 821, pages 71-86.
Crossref
Jung-Heum Park, Jae-Hoon Kim & Hyeong-Seok Lim. (2019) Disjoint path covers joining prescribed source and sink sets in interval graphs. Theoretical Computer Science 776, pages 125-137.
Crossref
Jung-Heum Park. (2016) Paired many-to-many disjoint path covers in restricted hypercube-like graphs. Theoretical Computer Science 634, pages 24-34.
Crossref
Jung-Heum Park, Joonsoo Choi & Hyeong-Seok Lim. (2016) Algorithms for finding disjoint path covers in unit interval graphs. Discrete Applied Mathematics 205, pages 132-149.
Crossref
Jung-Heum Park. (2016) Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs. Theoretical Computer Science 617, pages 45-64.
Crossref
Sook-Yeon Kim & Jung-Heum Park. (2014) Many-to-many two-disjoint path covers in restricted hypercube-like graphs. Theoretical Computer Science 531, pages 26-36.
Crossref
Sook-Yeon Kim & Jung-Heum Park. (2013) Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m,4))$. IEEE Transactions on Computers 62:12, pages 2468-2475.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.