An optimal algorithm for finding locally connected spanning trees on circular-arc graphs

Resource

Proceedings of the 24th Workshop on Combinatorial Mathematics and Computation Theory, Taiwan, pp. 10-18

Journal

Proceedings of the 24th Workshop on Combinatorial Mathematics and Computation Theory, Taiwan

Pages

10-18

Date Issued

2007

Date

2007

Author(s)

Lin C. C.

Chang G. J.

Chen G. H.

URI

Type

conference paper

File(s)

Name

17.pdf

Size

467.48 KB

Format

Adobe PDF

Checksum

(MD5):f131388113f412076e431f11868df4d1