First Page | Document Content | |
---|---|---|
Date: 2014-09-25 06:28:22Graph 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 TsaparasAdd to Reading ListSource URL: www.cs.uoi.grDownload Document from Source WebsiteFile Size: 604,12 KBShare Document on Facebook |