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

First Page		Document Content
Date: 2014-09-25 06:28:22 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 Source URL: www.cs.uoi.gr Download Document from Source Website File Size: 604,12 KB Share Document on Facebook

	On Maximum Differential Graph Coloring Yifan Hu1 , Stephen Kobourov2 , and Sankar Veeramoni2 1 2 DocID: 1uNMt - View Document
	Distrib. Comput:261–280 DOIs00446Distributed algorithms for the Lovász local lemma and graph coloring Kai-Min Chung1 · Seth Pettie2 · Hsin-Hao Su3 DocID: 1uyZk - View Document
	Graph and hypergraph oloring Mi hael Krivelevi h 1. Basi denitions: vertex oloring, hromati number, edge oloring, hromati index. Coloring innite graphs, De Brujin-Erd}os theorem 2. Vertex degrees and olorings. DocID: 1upWX - View Document
	Distributed Computing Prof. R. Wattenhofer BA/MA/SA: Heuristics for Graph Coloring DocID: 1uobf - View Document
	AUT Journal of Electrical Engineering AUT J. Elec. Eng., 130 DOI: eejData Hiding Method Based on Graph Coloring and Pixel Block‘s Correlation in Color Image DocID: 1tYtr - View Document