graph theoretic code [计] 图论码
graph theoretic algorithm [数] 图论算法
graph theoretic computer algorithm [计] 图论计算机算法
graph-theoretic distance 图解理论距离
Graph-Theoretic Concepts in Computer Science 计算机科学中的图论概念
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布图设计具有一定的理论和实用意义。
应用推荐