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]
@inproceedings{SadasivamZ09, title = {NP-Completeness of ::::st::::-Orientations for Plane Graphs}, author = {Sadish Sadasivam and Huaming Zhang}, year = {2009}, doi = {10.1007/978-3-642-03409-1_27}, url = {http://dx.doi.org/10.1007/978-3-642-03409-1_27}, tags = {completeness, graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/SadasivamZ09}, cites = {0}, citedby = {0}, pages = {298-309}, booktitle = {Fundamentals of Computation Theory, 17th International Symposium, FCT 2009, Wroclaw, Poland, September 2-4, 2009. Proceedings}, editor = {Miroslaw Kutylowski and Witold Charatonik and Maciej Gebala}, volume = {5699}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-03408-4}, }