Učitavanje...
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...
Spremljeno u:
| Izdano u: | Theory Comput Syst |
|---|---|
| Glavni autori: | , , , |
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
Springer US
2017
|
| Teme: | |
| Online pristup: | 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 |
| Oznake: |
Dodaj oznaku
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|