Browse "School of Computing(전산학부)" by Author Jo, Shin-Haeng

Showing results 1 to 2 of 2

1
Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs

Jo, Shin-Haeng; Park, Jung-Heum; Chwa, Kyung-Yong, INFORMATION SCIENCES, v.242, pp.103 - 112, 2013-09

2
Path cover problems on bipartite interconnection networks = 이분 상호연결망에서의 경로 커버 문제link

Jo, Shin-Haeng; 조신행; Shin, Sung-Yong; 신성용; et al, 한국과학기술원, 2013

Discover

Type

. next

Open Access

Date issued

. next

Subject

. next

rss_1.0 rss_2.0 atom_1.0