مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

video

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

sound

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Version

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View:

420
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Download:

304
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Cites:

Information Journal Paper

Title

MINIMUM HEIGHT PATH PARTITIONING OF TREES

Pages

  99-104

Abstract

GRAPH PARTITIONING is a well-known problem in the literature. In this paper, PATH PARTITIONING of trees in which the given tree is partitioned into edge-disjoint paths is considered. A linear time algorithm is given for computing a PATH PARTITIONING of minimum height.

Multimedia

  • No record.
  • Cites

  • No record.
  • References

  • No record.
  • Cite

    APA: Copy

    BAGHERI, A., & RAZAZI, M.. (2010). MINIMUM HEIGHT PATH PARTITIONING OF TREES. SCIENTIA IRANICA, 17(2 (TRANSACTION D: COMPUTER SCIENCE AND ENGINEERING AND ELECTRICAL ENGINEERING)), 99-104. SID. https://sid.ir/paper/290002/en

    Vancouver: Copy

    BAGHERI A., RAZAZI M.. MINIMUM HEIGHT PATH PARTITIONING OF TREES. SCIENTIA IRANICA[Internet]. 2010;17(2 (TRANSACTION D: COMPUTER SCIENCE AND ENGINEERING AND ELECTRICAL ENGINEERING)):99-104. Available from: https://sid.ir/paper/290002/en

    IEEE: Copy

    A. BAGHERI, and M. RAZAZI, “MINIMUM HEIGHT PATH PARTITIONING OF TREES,” SCIENTIA IRANICA, vol. 17, no. 2 (TRANSACTION D: COMPUTER SCIENCE AND ENGINEERING AND ELECTRICAL ENGINEERING), pp. 99–104, 2010, [Online]. Available: https://sid.ir/paper/290002/en

    Related Journal Papers

  • No record.
  • Related Seminar Papers

  • No record.
  • Related Plans

  • No record.
  • Recommended Workshops






    Move to top
    telegram sharing button
    whatsapp sharing button
    linkedin sharing button
    twitter sharing button
    email sharing button
    email sharing button
    email sharing button
    sharethis sharing button