在线免费看片a欧美,午夜AV不卡网站在线播放,久久综合尹人77777,96国产在线分享

    

      

      <s id="srvai"></s>
      

      
    
      
        
        
    
      

      

      
	
      
		
      vertex independent number
      
		
      基本解釋[頂]點(diǎn)獨(dú)立數(shù)
      
	
      
  
      
    
  
      
	
      網(wǎng)絡(luò)釋義
      1)vertex independent number,[頂]點(diǎn)獨(dú)立數(shù)2)vertex-independent set,頂點(diǎn)獨(dú)立集3)set of independent vertices,獨(dú)立頂點(diǎn)集4)independence number,點(diǎn)獨(dú)立數(shù)5)Independent set of graph vertexes,圖的頂點(diǎn)獨(dú)立集6)maximal set of independent vertices,極大獨(dú)立頂點(diǎn)集
      
	
      用法和例句
      Using the huge parallelism of DNA sticker models, we first decompose the vertex-coloring problems of graph into vertex-independent set problems and vertex-partition problems from the essence of problems and show DNA sticker algorithms of the two problems.
      利用DNA粘貼模型的巨大并行性,從圖頂點(diǎn)著色問(wèn)題的本質(zhì)出發(fā),先把著色問(wèn)題分解成頂點(diǎn)獨(dú)立集問(wèn)題和頂點(diǎn)劃分問(wèn)題并給出這兩個(gè)問(wèn)題的DNA粘貼算法,然后調(diào)用這兩個(gè)算法解決了圖頂點(diǎn)著色問(wèn)題。
      Some relations between the independence number and   other parameters in K_(1,r) -free graphs;
      K_(1 ,r)- free圖中點(diǎn)獨(dú)立數(shù)與其它參數(shù)之間的關(guān)系(英文)
      

      

      
	
      最新行業(yè)英語(yǔ)
      
	
      
		
	
      

      

      
	
      行業(yè)英語(yǔ)