hamilton path 中文意思是什麼

hamilton path 解釋
漢米爾頓徑
  • hamilton : n. 漢密爾頓〈姓氏,男子名〉。n. 漢密爾頓〈加拿大港市,百慕達群島首府〉。
  • path : path(ol )=pathological; pathology n (pl paths )1 (自然踏成的)路;路徑;(馬路邊上的)人行...
  1. Claw - free graphs have been a subject of interest of many authors in the recent years. the first motivation for studying properties of claw - free graphs apparently appeared from the beineke ' s characterization of line graphs in [ 4 ], [ 5 ]. however, the main impulse that turned the attention of the graph theory community to the class of claw - free graphs was given in late 70s and early 80s. during the period some first results on hamiltonian properties were proved in [ 6 ], [ 7 ], [ 8 ], [ 9 ]. prom then on, more and more authors began to study the problem of hamilton. they studied mainly in the following two aspects : cycle aspect and path aspect. we may obtain some results about cycle in [ 3 ] and [ 10 - 30 ]

    研究該圖類的最初動機來源於deineke [ 4 ] , [ 5 ]線圖的特性,然而引起人們尤其注意是在70年代末80年代初,整個這個時期在[ 6 ] , [ 7 ] , [ 8 ] , [ 9 ]中關于哈密頓性質的一些初步結果被證明從此用無爪圖來研究哈密頓問題日益活躍,人們主要從以下兩個方面來研究:圈方面和路方面其中關于圈方面的部分結果可參見文獻[ 3 ]及[ 10 - 30 ]等
  2. Category - i maximal graphs with given number of path - hamilton edges

    邊數的一類極圖
  3. Since adleman solve the hamilton path problem using dna molecules in 1994, many mathematical problems were solved by dna computing such as matrix multiplication, addition, symbolic determinants

    最早的,也是最著名的是1994年science上發表的美國科學家adleman的七節點hamilton路徑問題的dna計算解決辦法。
  4. Since adleman solve the hamilton path problem using dna molecules in 1994, many mathematical problems were solved by self - assembly of dna such as matrix multiplication, addition, symbolic determinants

    目前己驗證有大量的問題可以通過dna計算來解決,最著名的當然是1994年science上發表的美國科學家adleman的七節點hamilton路徑問題的dna計算解決辦法。
  5. Hamilton problem is one of fundamental problems in graph theory, the following aspects are mainly focused on : cycle problem and path problem. in detail, they are mainly problems of hamilton cycle, cycle extensibility, longest cycle and hamilton path, hamilton - connectivity, panconnectivity, path extensibility, longest path etc. as to hamilton cycle problem, we have got many results

    Hamilton問題是圖論研究的基本問題之一,主要集中在以下兩個方面:圈問題和路問題,具體地講主要有: hamilton圈問題,圈可擴性問題,最長圈問題等以及hamilton路問題, hamiltonj ji問題,泛溯問題,路可擴性問題,最長路問題等
分享友人