最大クリーク問題
1. Clique problemIn computer science, the clique problem refers to any of the problems related to finding particular complete subgraphs in a graph, i.e. , sets of elements where each pair of elements is connected. For example, the maximum clique problem arises in the following real-world setting. Consider a social network, where the graph’s vertices represent people, and the graph’s edges represent mutual acquaintance.
Read “Clique problem” on English Wikipedia
Read “最大クリーク問題” on Japanese Wikipedia
Read “Clique problem” on DBpedia
Read “Clique problem” on English Wikipedia
Read “最大クリーク問題” on Japanese Wikipedia
Read “Clique problem” on DBpedia
Discussions
Log in to talk about this word.