Browse "School of Computing(전산학부)" by Author Jo, Shin-Haeng
Showing results 1 to 2 of 2
| 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 |
| Path cover problems on bipartite interconnection networks = 이분 상호연결망에서의 경로 커버 문제link Jo, Shin-Haeng; 조신행; Shin, Sung-Yong; 신성용; et al, 한국과학기술원, 2013 |
Discover
Open Access
- 187 OA Article
Date issued
- 1,775 2020 - 2024
- 5,388 2010 - 2019
- 4,587 2000 - 2009
- 2,927 1990 - 1999
- 839 1980 - 1989