有向圖 的英文怎麼說

中文拼音 [yǒuxiàngtú]
有向圖 英文
digraph（directed graph）
  • 有 : 有副詞[書面語] （表示整數之外再加零數）: 30 有 5 thirty-five; 10 有 5年 fifteen years
  • 圖 : Ⅰ名詞1 （繪畫表現出的形象; 圖畫） picture; chart; drawing; map 2 （計劃） plan; scheme; attempt 3...
  1. The condensation of d is a directed graph with m vertices.

    D的凝聚圖是指一個有m個頂點的有向圖。
  2. An approach to seeking bgp policy confliction based on reconstructing dispute diagraph with three - dimensional matrix

    基於三維矩陣重構爭論有向圖的域間路由振蕩檢測演算法
  3. Digraphs have a simple pictorial representation.

    有向圖有簡單的圖形表示。
  4. Exponents of a class of two - colored digraphs

    一類雙色有向圖的指數
  5. Some algebraic properties of the digraph

    有向圖的一些代數性質
  6. The upper bounds of the spectral radius of digraphs in term of average 2 - degrees

    有向圖的譜半徑的二次度形式的上界
  7. If the edges are ordered pairs of vertices then we get the notions of a directed graph and directed multigraph.

    如果邊都是頂點的有序對，則得到有向圖和有向重圖的概念。
  8. To avoid detail we shall use the latter symbol for both undirected and directed graphs and rely on the context for clarity.

    為了避免瑣碎，對無向圖和有向圖我們都採用后一符號，而靠上下文加以澄清。
  9. Having fully absorbed the former researching results, f " abrega, herzog and guttman brought forward a kind of formal method named strand space, which is a practical, intuitive and strict one for security protocols analysis. the model uses a kind of order graph between its nodes existing casual relationship to represent protocol executions

    串空間（ strandspace ）模型由f ' abrega 、 herzog和guttman三人提出，它是分析安全協議的一種實用、直觀和嚴格的形式化方法，它充分吸收了前人的研究成果，模型使用一種節點間存在因果關系的有向圖來表示協議的運行。
  10. Aiming at this problem, the main research issues and achievements in this paper are as follows : bi - directional data transformation between rdb and xml with semantic constraints preserved for most of existing researches on static data transformation between xml and rdb, dtd is taken as the schema description language for xml, and the semantic constraints are often lost during the transformation process. to overcome these disadvantages, the author adopts xml - schema, a standard schema description language proposed by w3c to replace dtd, as the description method owing to its more powerful functions than dtd, and of course with the syntax much more complicated. after analyzing the constraints characteristics in both xml - schema and relational schema, a semantic constraints - preserved algorithm is proposed which can realize the bi - directional schema mapping between rdb and xml through a formalized description of xml based on regular tree and a general expression for relational schema based on direct graph approach

    保留語義約束的xml與rdb雙向靜態數據轉換技術現有研究大多採用dtd （ documenttypedefinition ，文檔類型定義）作為xml的模式描述語言，並且在模式映射過程中丟失語義約束信息，本文分析了xml - schema （ xml - schema採用與dtd完全不同的語法，數據描述能力更強同時也更為復雜，已被w3c確定為替代dtd作為xml模式描述語言的標準）及關系模式的語義約束特徵，通過基於正則樹的xml形式化描述方法以及基於有向圖的一般關系模式表示方法的研究，建立保留語義約束的xml - schema與關系模式的雙向模式映射演算法，實現了xml與rdb的雙向數據轉換，較好地解決了xml與rdb在靜態數據轉換層面的數據集成問題，可有效滿足企業大量rdb數據面向xml的發布以及與日俱增的xml數據存入rdb的應用需求。
  11. The basis is hierarchical placement based on the model of directed graph partition. introducing timing - driven placement to clustering, it is an excellent method that mixes the characteristics of timing - driven placement, clustering and directed graph partition. integrated with cdp, this algorithm can solve the system - level vfg problems of electronic devices

    該演算法是基於有向圖分解模型的分級布局演算法，將定時驅動布局思想引入結群過程，是集定時驅動布局、基於結群的布局、基於劃分的布局和有向圖分解思想為一體的快速布局演算法。
  12. In 1978, an algorithm for minimizing total weighted completion time with a series - parallel precedence was given by lawler

    1978年lawler給出當任務間的優先約束關系為串並有向圖時，加權總完工時間問題的演算法。
  13. We show that under the consideration of discounted factor, jobs in the p - maximal initial set / * of module m should be processed prior to other jobs in module m, and the schedule is the optimal if the jobs in i * are n ' t be preempted by the jobs in n i *. this result is a extension of lawler ' s method for minimizing total weighted completion time with a series - parallel precedence

    證明了在考慮折扣因子的條件下，模塊m的因子最大初始集合i中的任務優先於模塊m中的其他任務，並且被連續加工所得的排序為最優排序：該結果推廣了lawler用來求解約束為串並有向圖的單機加權總完工時間問題的由底向上搜索分解樹的方法。
  14. A method of extracting information from web

    漢語分詞有向圖的快速生成演算法
  15. In fact, it is helpful to the development of graph theory to discover special kinds of integral directed graphs

    事實上，對于有向圖的整性的研究，對圖論的發展和豐富有著重大意義。
  16. Generalized primitive exponents of digraphs are generalizations of traditional primitive exponents of primitive digraphs, with applications in memoryless communication systems

    有向圖的廣義本原指數是本原有向圖傳統本原指數的推廣，應用在非記憶通訊系統中。
  17. ( 3 ) we give an upper bound for lewin index, which is related to generalized primitive exponents of primitive digraph of order n and girth 2, determine the index set of this class digraph and discuss the extreme cases

    （ 3 ）第4節分析了圍長為2的n階本原有向圖的l （ g ）的上界及相應的指數集，並討論了極端情形。
  18. The main results are : ( 1 ) we give an upper bound for kth generalized primitive exponents of primitive digraphs with order n and girth 2, and determine the exponent set of this class digraphs in section 2

    主要內容有三部分： （ 1 ）第2節給出了圍長為2的n階本原有向圖的第k個頂點指數（ exp _ d （ k ） ）的上界及相應的指數集。
  19. ( 2 ) we give an upper bound for kth generalized primitive exponents of non - primitive digraphs with order n and girth 2, determine the exponent set of this class digraphs in section 3, and discuss the extreme cases

    （ 2 ）第3節給出了圍長為2的n階非本原有向圖的第k個頂點指數（ exp _ d （ k ） ）的上界及相應的指數集，討論了極端情形。
  20. Using matrix theory, we present a sharp upper bound on the spectral radius of digraphs and strongly connected diagraphs

    摘要利用矩陣理論，給出了簡單有向圖的譜半徑可達上界和強連通有向圖的譜半徑上界。
分享友人
分享到 Line

分享到臉書