Back to Results
First PageMeta Content
Graph theory / Mathematics / NP-complete problems / Combinatorial optimization / Graph connectivity / Graph coloring / Graph / Matching / Triadic closure / Clique problem / Vertex cover / Clique


Using Strong Triadic Closure to Characterize Ties in Social Networks Stavros Sintos Panayiotis Tsaparas
Add to Reading List

Document Date: 2014-09-25 06:28:22


Open Document

File Size: 604,12 KB

Share Result on Facebook