Serna, M., Κυρούσης, Λ. Μ., & Σπυράκης, Π. Γ. (1989). Testing Whether a Graph has a Nontrivial 3-Connected Subgraph is P-Complete Under NC1 Reductions CTI Technical Report TR 76.2.89 [89.2.76]. Ινστιτούτο Τεχνολογίας Υπολογιστών Computer Technology Institute Polytechnic University of Catalunia, Spain Courant Institute of Mathematical Sciences, U.S.A.
Παραπομπή σε μορφή Chicago (17η εκδ.)Serna, Maria, Λευτέρης Μ Κυρούσης, και Παύλος Γ Σπυράκης. Testing Whether a Graph Has a Nontrivial 3-Connected Subgraph Is P-Complete Under NC1 Reductions CTI Technical Report TR 76.2.89 [89.2.76]. Πάτρα Ελλάδα Patras Greece Catalonia Spain New York USA: Ινστιτούτο Τεχνολογίας Υπολογιστών Computer Technology Institute Polytechnic University of Catalunia, Spain Courant Institute of Mathematical Sciences, U.S.A, 1989.
Παραπομπή σε μορφή MLA (8th εκδ.)Serna, Maria, et al. Testing Whether a Graph Has a Nontrivial 3-Connected Subgraph Is P-Complete Under NC1 Reductions CTI Technical Report TR 76.2.89 [89.2.76]. Ινστιτούτο Τεχνολογίας Υπολογιστών Computer Technology Institute Polytechnic University of Catalunia, Spain Courant Institute of Mathematical Sciences, U.S.A, 1989.
