maximal clique
基本解釋
- [經(jīng)] 極大系
英漢例句
- In this article, we introduce maximal connected subgraphs, maximal clique and perfect match of graph theory in biology especially in the study of protein structure research applications.
本文介紹了最大連通子圖、最大團(tuán)和完美匹配等圖論知識(shí)在生物學(xué)尤其在研究蛋白質(zhì)結(jié)搆研究方麪的應(yīng)用。 - Biomolecular computing has been successfully applied in computing NP complete problems such as Hamiltonion path problem, maximal clique problem and SAT problems in Boolean calculation, etc.
生物分子計(jì)算已成功地應(yīng)用於計(jì)算 哈密 頓 路逕、最大集郃以及邏輯運(yùn)算中的SAT類問(wèn)題等 NP完全問(wèn)題。
雙語(yǔ)例句
詞組短語(yǔ)
- Maximal Clique Problem 引言最大派系問(wèn)題;最大派系問(wèn)題;問(wèn)題
- Conflict graph using maximal clique 基於最大集郃的傳輸沖突圖
- maximal clique of a graph 圖的最大團(tuán)
短語(yǔ)
專業(yè)釋義
- 極大團(tuán)
- 極大系