Heuristic Reconfiguration Problem baed on Minimum-Cut Method on the area of Cells
Vol. 23, No. 9, pp. 2506-2515, Sep. 1998
Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.
|
|
Cite this article
[IEEE Style]
임화경 and 김성천, "Heuristic Reconfiguration Problem baed on Minimum-Cut Method on the area of Cells," The Journal of Korean Institute of Communications and Information Sciences, vol. 23, no. 9, pp. 2506-2515, 1998. DOI: .
[ACM Style]
임화경 and 김성천. 1998. Heuristic Reconfiguration Problem baed on Minimum-Cut Method on the area of Cells. The Journal of Korean Institute of Communications and Information Sciences, 23, 9, (1998), 2506-2515. DOI: .
[KICS Style]
임화경 and 김성천, "Heuristic Reconfiguration Problem baed on Minimum-Cut Method on the area of Cells," The Journal of Korean Institute of Communications and Information Sciences, vol. 23, no. 9, pp. 2506-2515, 9. 1998.
pISSN : 1226 - 4717
eISSN : 2287 - 3880