bipartite,英語單詞,主要用作形容詞,作形容詞時譯為“雙邊的;由兩部分構成的;一式兩份的;雙方的”。
基本介紹
- 外文名:bipartite
- 詞性:形容詞
- 英式發音:[baɪˈpɑːtaɪt]
- 美式發音:[baɪˈpɑːrtaɪt]
- 釋義:雙邊的;由兩部分構成的;一式兩份的;雙方的
bipartite,英語單詞,主要用作形容詞,作形容詞時譯為“雙邊的;由兩部分構成的;一式兩份的;雙方的”。
Bipartite graph Bipartite graph中文叫二分圖、二部圖和偶圖,是圖論中一種特殊模型。二分圖,二部圖,偶圖,是圖論中一種特殊模型。指頂點可以分成兩個不相交的集使得在同一個集內的頂點不相鄰(沒有共同邊)的圖。
分線枯葉蛾(Arguda bipartite Leech,1899)是枯葉蛾科線枯葉蛾屬的一種動物。形態特徵 雄蛾翅展62—65mm。下唇須黑褐色,向前伸。前胸中間呈棕紅色毛鱗。觸角、體、翅均呈黃褐色。前翅呈直角三角形,頂角不突出,外緣亦平直。前翅由...
二分圖又稱作二部圖,是圖論中的一種特殊模,頂點集V可分割為兩個互不相交的子集,並且圖中每條邊依附的兩個頂點都分屬於這兩個互不相交的子集,兩個子集內的頂點不相鄰。在二分圖中尋找最小覆蓋的問題為二分覆蓋(bipartite - ...
中每個頂點相鄰,則稱圖G為完全二分圖(complete bipartite graph),或稱完全偶圖,記為 。相關概念 圖G=(V,E)各條邊都加上方向的圖稱為有向圖,否則稱為無向圖。如果有的邊有方向,有的邊無方向,則稱為混合圖。任兩頂點...
1.6 Bipartite graphs 1.7 Contraction and minors 1.8 Euler tours 1.9 Some linear algebra 1.10 Other notions of graphs Exercises Notes 2 Matching, Covering and Packing 2.1 Matching in bipartite graphs 2.2 Matching ...
有些問題像是決定一個圖形是否為二分圖(bipartite graph)或測試兩個圖形使否有相同數量的連結元件(connected component),接著針對這些問題產出原地算法。參考SL有更多的資訊。隨意的角色 在很多情況,藉由使用隨機化算法(randomized ...
Hall定理是Hall於1935年提出的關於二部圖匹配存在性的理論。定理描述 英文描述 Let G be a bipartite graph with partition X,Y.G contains a matching of X if and only if |N(S)| ≥ |S| for all S ⊆ X.中文翻譯 對...
6.2.1 Distributed event-based bipartite consensus 127 6.2.2 Self-triggered approach 140 6.2.3 Numerical example 143 6.3 Summary 146 References 146 Chapter 7 Finite-Time and Fixed-Time Bipartite Consensus for Multi-...
2.1.1 Bipartite Approach 2.1.2 Tripartite Approach 2.1.3 Quadripartite Approach 2.2 Approaching Is from Phonology and Syntax 2.2.1 Deriving Focus from Stress 2.2.2 Deriving Information Structure from Syntax ...
Bipartite Graphs Exercises 1.3 Vertex Degrees and Counting Counting and Bijections Extremal Problems Graphic Sequences Excercises 1.4 Directed Graphs Definitions and Examples Vertex Degrees Eulerian Digraphs Orientations and ...
bipartisan partisan bipartite birth date birthday Black black blacken black berry blackberry black bird blackbird black list blacklist bloc block blond blonde bloom blossom bona fides bona fide bom bome bravado bravery breach ...
短語搭配 false oolite 假鮞粒 oolite bar 鮞狀砂壩 bipartite oolite 對分鯢石 oolite deformation 鮞粒變形 great oolite 大鮞石 oolite ironstone 魚卵狀鐵礦 inferior oolite 底鮞狀岩 oolite ool 鮞狀岩 deformed oolite 變形鮞粒 ...
47. Sergio Albeverio, Shao-Ming Fei, Preeti Parashar and Wen-Li Yang, Nonlocal Properties and Local Invariants for Bipartite Systems, Phys. Rev. A 68 (Rapid Comm.) (2003) 010303.48. Shao-Ming Fei, Xiu-Hong Gao,...
1.6 Bipartite graphs 1.7 Contraction and minors 1.8 Euler tours 1.9 Some linear algebra 1.10 Other notions of graphs Exercises Notes 2 Matching, Covering and Packing 2.1 Matching in bipartite graphs 2.2 Matching in...
I also prove that the bipartite rank three entangled states are distillable under local operations and classical communication.我們證明了秩等於三的雙體糾纏態在局域操作和經典聯繫的條件下都是可提純的。The duration of bound-...
當Q為bipartite箭圖時,這個李代數實現了相應的半單李代數的冪零部分。當Q為A型線性定向的箭圖時,這個李代數實現了自由二階冪零李代數。並且我們刻畫了這個李代數的根系。這些聯繫是嶄新的,被一些專家認為是Hall代數方向的重要進展。
Jin Yan, Guizhen Liu, On 2-factors with quadrilaterals containing specified vertices in a bipartite graph, Ars Combinatorics 82 (2007),133-144. (SCI)Jianliang Wu, Jianfeng Hou and Guizhen Liu, The linear arboricity of...
本身不存在直接相連的邊,任意一邊分別連線著某一個校驗節點和某一個變數節點,稱這種圖為二分圖(Bipartite Graph),即Tanner圖。在Tanner圖中定義一個節點的度數為與這個節點相連線的邊個數。因此,變數節點 的度數等於包含 的校驗和...
Y. Caro, Y. Li, C. Rousseau, Y. Zhang, Asymptotic bounds for some bipartite graph: complete graph Ramsey numbers, Discrete Math., V220 (2000), 51-56.Y. Li, C. Rousseau, W. Zang, Asymptotic upper bounds for ...
6.2 Bipartite graph and perfect matching 6.3 Matching polynomial 6.4 The relation between spectrum and matching polynomial 6.5 Relation between several graphs 6.6 Several matching equivalent and matching unique graphs 6.7 ...