On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs (Q1262768): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(89)90127-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2019615222 / rank | |||
Normal rank | |||
Revision as of 20:38, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs |
scientific article |
Statements
On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs (English)
0 references
1989
0 references
See the review in Zbl 0643.68086.
0 references
parallel algorithms
0 references
subgraph homeomorphism
0 references
subgraph isomorphism
0 references
planar graphs
0 references
NC algorithm
0 references
