Partitioning graphs into Hamiltonian ones (Q1352030): 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/0167-8191(95)00007-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2052379151 / rank | |||
Normal rank | |||
Latest revision as of 18:33, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning graphs into Hamiltonian ones |
scientific article |
Statements
Partitioning graphs into Hamiltonian ones (English)
0 references
27 February 1997
0 references
Parallel algorithms
0 references
Graph partition
0 references
Hamiltonian graphs
0 references
Bipartite permutation graphs
0 references
Time and processor requirements
0 references
