Lanean...
On Finding and Enumerating Maximal and Maximum k-Partite Cliques in k-Partite Graphs
Let k denote an integer greater than 2, let G denote a k-partite graph, and let S denote the set of all maximal k-partite cliques in G. Several open questions concerning the computation of S are resolved. A straightforward and highly-scalable modification to the classic recursive backtracking approa...
Gorde:
| Argitaratua izan da: | Algorithms |
|---|---|
| Egile Nagusiak: | , , , , , |
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
2019
|
| Gaiak: | |
| Sarrera elektronikoa: | https://ncbi.nlm.nih.gov/pmc/articles/PMC6707360/ https://ncbi.nlm.nih.gov/pubmed/31448059 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.3390/a12010023 |
| Etiketak: |
Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|