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]
Main Authors: | , , |
---|---|
Format: | Book |
Language: | English |
Published: |
Πάτρα Ελλάδα Patras Greece Catalonia Spain New York USA
Ινστιτούτο Τεχνολογίας Υπολογιστών Computer Technology Institute Polytechnic University of Catalunia, Spain Courant Institute of Mathematical Sciences, U.S.A.
1989
|
Subjects: |
Μηχανικών Η/Υ και Πληροφορικής: Unknown
Call Number: |
Unknown |
---|---|
Copy 1 | Available |