Sook-Yeon Kim

According to our database, Sook-Yeon Kim authored at least 10 papers between 1995 and 2014.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2014

Many-to-many two-disjoint path covers in restricted hypercube-like graphs.

Sook-Yeon Kim, Jung-Heum Park

Theor. Comput. Sci., 2014

2013

Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m, 4))$.

Sook-Yeon Kim, Jung-Heum Park

IEEE Trans. Computers, 2013

2011

Disjoint path covers in recursive circulants G(2^m, 4) with faulty elements.

Sook-Yeon Kim, Jae-Ha Lee, Jung-Heum Park

Theor. Comput. Sci., 2011

2003

Effect of load distribution in path protection of MPLS.

Sook-Yeon Kim

Int. J. Commun. Syst., 2003

2002

Information Model for Policy-Based Network Security Management.

Sook-Yeon Kim, Myung-Eun Kim, Kiyoung Kim, Jongsoo Jang

Proceedings of the Information Networking, 2002

1999

An Approach for Torus Embedding.

Sook-Yeon Kim, Jeen Hur

Proceedings of the 1999 International Conference on Parallel Processing Workshops, 1999

1998

Embeddings of Butterflies into Hypermeshes.

Sook-Yeon Kim, Oh-Heum Kwon, Kyung-Yong Chwa

Parallel Process. Lett., 1998

Multiple Graph Embeddings into a Processor Array with Spanning Buses.

Sook-Yeon Kim, Kyung-Yong Chwa

J. Parallel Distributed Comput., 1998

1997

Optimal embeddings of multiple graphs into a hypermesh.

Sook-Yeon Kim, Kyung-Yong Chwa

Proceedings of the 1997 International Conference on Parallel and Distributed Systems (ICPADS '97), 1997

1995

Edge-disjoint embedding of large full binary trees into hypercubes.

Sook-Yeon Kim, Kyung-Yong Chwa

Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, 1995