NP-Completeness of ::::st::::-Orientations for Plane Graphs

Sadish Sadasivam, Huaming Zhang. NP-Completeness of ::::st::::-Orientations for Plane Graphs. In Miroslaw Kutylowski, Witold Charatonik, Maciej Gebala, editors, Fundamentals of Computation Theory, 17th International Symposium, FCT 2009, Wroclaw, Poland, September 2-4, 2009. Proceedings. Volume 5699 of Lecture Notes in Computer Science, pages 298-309, Springer, 2009. [doi]

Authors

Sadish Sadasivam

This author has not been identified. Look up 'Sadish Sadasivam' in Google

Huaming Zhang

This author has not been identified. Look up 'Huaming Zhang' in Google