Loading...
Finding Cactus Roots in Polynomial Time
A graph H is a square root of a graph G, or equivalently, G is the square of H, if G can be obtained from H by adding an edge between any two vertices in H that are of distance 2. The Square Root problem is that of deciding whether a given graph admits a square root. The problem of testing whether a...
Na minha lista:
| Udgivet i: | Theory Comput Syst |
|---|---|
| Main Authors: | , , , |
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
Springer US
2017
|
| Fag: | |
| Online adgang: | https://ncbi.nlm.nih.gov/pmc/articles/PMC6438640/ https://ncbi.nlm.nih.gov/pubmed/30996654 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/s00224-017-9825-2 |
| Tags: |
Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
|