Name
Title | ||
|---|---|---|
A Locally Connected Spanning Tree Can Be Found in Polynomial Time on Simple Clique 3-Trees. |
Year | Venue | Field |
|---|---|---|
2016 | ICTCS | Discrete mathematics,Combinatorics,Minimum degree spanning tree,Clique,k-minimum spanning tree,Connected dominating set,Spanning tree,Time complexity,Shortest-path tree,Mathematics,Minimum spanning tree |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tiziana Calamoneri | 1 | 511 | 46.80 |
| Matteo Dell'Orefice | 2 | 0 | 0.68 |
| Angelo Monti | 3 | 671 | 46.93 |