逢甲學報, Band 38逢甲大學, 2000 |
Im Buch
Ergebnisse 1-3 von 6
Seite 90
... vertices is | V = n , and the number of edges and edge weights is m = | E | . All graphs are connected , otherwise the problem reduces trivially to a smaller problems . Let T be a subset of V with [ 7 ] = k < n , called target vertices ...
... vertices is | V = n , and the number of edges and edge weights is m = | E | . All graphs are connected , otherwise the problem reduces trivially to a smaller problems . Let T be a subset of V with [ 7 ] = k < n , called target vertices ...
Seite 91
... vertices are not specified [ 1 , 2 , 3 , 4 , 5 , 6 , 7 ] . We focus on the k - cut problem in a general graph with arbitrary k target vertices . Unless P = NP [ 8 ] , one must expect exponential dependence on k . Existing methods can ...
... vertices are not specified [ 1 , 2 , 3 , 4 , 5 , 6 , 7 ] . We focus on the k - cut problem in a general graph with arbitrary k target vertices . Unless P = NP [ 8 ] , one must expect exponential dependence on k . Existing methods can ...
Seite 93
... vertices 1 , 3 , 5 , 7 are the target vertices , i.e. T = { 1 , 3 , 5 , 7 } . ✩e , = 1 2 3 e3 = 1 e1 = 4 e1 = 1 e , = 4 ) e = 3 5 6 e = 2 e = 1 7 eo 8 ) Solve : Figure 1 An example of the Branch - and - Bound algorithm 8 ' STEP 0 ...
... vertices 1 , 3 , 5 , 7 are the target vertices , i.e. T = { 1 , 3 , 5 , 7 } . ✩e , = 1 2 3 e3 = 1 e1 = 4 e1 = 1 e , = 4 ) e = 3 5 6 e = 2 e = 1 7 eo 8 ) Solve : Figure 1 An example of the Branch - and - Bound algorithm 8 ' STEP 0 ...
Inhalt
The Research of Pegging the National Annuity Insurance Premium along | 1 |
Evidence from Taiwan and The | 11 |
The Java Processors to Enhance Execution Performance | 29 |
8 weitere Abschnitte werden nicht angezeigt.
Andere Ausgaben - Alle anzeigen
Häufige Begriffe und Wortgruppen
active inductor adiabatic B1 for various Biot number bytecodes cast iron roller causality Chill depth chilled gray cast chiller chiller material circuit cointegration computation intensive applications convective instabilities critical Rayleigh number critical wavenumber cut in G(V d-MC candidate decision tree decreases deformably free depth ratio dr economic growth edge(s equation error correction execution Feng Chia University Figure fluid layer fluid-solid interface forecast error variance FPGA free upper surface Granger Granger-causality gray cast iron impulse responses inductance Java Class Library Java Engine Java processor Java programs Java Virtual Machine Journal of Feng k-cut problem Kohm maximal weight maximin cut maximum MESFET min-cut minimax algorithm minimax cut minimax/maximin cut node parameter G Rayleigh number Rc response of exports server shock sublayer surface tension Taiwan Taylor number temperature Theorem thermal conductivity ratio total weight variables variance decompositions vertex viscosity parameter B1 wavenumber ૐ ૐ ૐ