The Study on the Upper-bound of Labeling Number for Chordal and Permutation Graphs
The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 6, No. 8, pp. 2124-2132, Aug. 1999
10.3745/KIPSTE.1999.6.8.2124, PDF Download:
Abstract
Statistics
Show / Hide Statistics
Statistics (Cumulative Counts from September 1st, 2017)
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.
Statistics (Cumulative Counts from September 1st, 2017)
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]
J. T. Eui and H. K. Hee, "The Study on the Upper-bound of Labeling Number for Chordal and Permutation Graphs," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 6, no. 8, pp. 2124-2132, 1999. DOI: 10.3745/KIPSTE.1999.6.8.2124.
[ACM Style]
Jeong Tae Eui and Han Keun Hee. 1999. The Study on the Upper-bound of Labeling Number for Chordal and Permutation Graphs. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 6, 8, (1999), 2124-2132. DOI: 10.3745/KIPSTE.1999.6.8.2124.