Algorithms for Square Roots of Graphs (Q4764347)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithms for Square Roots of Graphs |
scientific article; zbMATH DE number 750744
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for Square Roots of Graphs |
scientific article; zbMATH DE number 750744 |
Statements
Algorithms for Square Roots of Graphs (English)
0 references
4 May 1995
0 references
distance
0 references
square root
0 references
planar graph
0 references
linear time algorithm
0 references
Hamilton cycles
0 references
NP-completeness
0 references
powers of graphs
0 references
0.8596594333648682
0 references
0.8371694684028625
0 references
0.8321236371994019
0 references
