The maximum clique problem (MCP) is a classical graph-theoretic problem, which aims to find the maximum complete subgraph of a given graph G.
最大团问题是一个经典的图论问题，其目标是找出给定的某个图的最大完全子图。
It is because that the network probability model is performed calculations from the graph-theoretic field model method (GTFM), so the GTFM and the EDM can be connected closely.
由于网络概率模型是由图论场模型法演绎而来，这样就将图论场模型法与出游法紧密联系在一起。
These strategies based on the graph theory have theoretic and practical significance in the design of VLSI.
这些策略均以图论为基础，对VLSI布图设计具有一定的理论和实用意义。
This paper adopts the method that unites self diagnosis and interactive diagnosis, and presents the system graph theoretic model, diagnosis contents, some tokens and fault vectors.
采用自诊断与互诊断相结合的方法，给出了分布式诊断算法、图论模型、诊断内容及算法中使用的报文种类、故障向量。
These strategies based on the graph theory have theoretic and practical significance in the des...
这些策略均以图论为基础，对VLSI布图设计具有一定的理论和实用意义。
Introducing graph theoretic concepts from circuit theory, a nonlinear model is established for fluid network control systems.
通过引入电路中的图论理论，建立了流体网络控制系统的非线性模型。
The graph-based model of network division is created, an algorithm fit for worm spread restraint is brought forward, and the theoretic analyze and simulations prove the efficiency of this approach.
建立了基于图的网络划分的模型，并提出了一种适于抑制蠕虫传播的网络划分的算法。
The graph-based model of network division is created, an algorithm fit for worm spread restraint is brought forward, and the theoretic analyze and simulations prove the efficiency of this approach.
建立了基于图的网络划分的模型，并提出了一种适于抑制蠕虫传播的网络划分的算法。
应用推荐