Parallel Algorithms for Planar Graph Isomorphism and Related Problems.
| dc.contributor.author | JaJa, Joseph F. | en_US |
| dc.contributor.author | Kosaraju, S. Rao | en_US |
| dc.contributor.department | ISR | en_US |
| dc.date.accessioned | 2007-05-23T09:36:12Z | |
| dc.date.available | 2007-05-23T09:36:12Z | |
| dc.date.issued | 1986 | en_US |
| dc.description.abstract | We present new efficient parallel algorithms for planar graph isomorphism and several related problems. Our main parallel model is the SQRT n x SQRT n mesh of processors, where n is the length of the input. Our results include O(SQRT n) time algorithms for finding a good separating cycle and the triconnected components of a planar graph, and for solving the single function coarsest partitioning problem. | en_US |
| dc.format.extent | 829830 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/4509 | |
| dc.language.iso | en_US | en_US |
| dc.relation.ispartofseries | ISR; TR 1986-86 | en_US |
| dc.title | Parallel Algorithms for Planar Graph Isomorphism and Related Problems. | en_US |
| dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1