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

Persian Verion
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:

196
Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Download:

0
Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Cites:

Information Journal Paper

Title

Computing Colored Average Degree of Graphs in Sublinear Time

Pages

  143-148

Abstract

 Graphs are common data structures which widely used for information storage and retrieval. Occasionally some vertices of a graph contain specific features or information, which we value in their effect. We consider modeling this effect formally, and we devise two super-fast algorithms to approximate the colored average degree. In the first method, we assume the information of each vertex is available; hence, the provided algorithm works with a 2+ϵ approximation factor. Eventually, we waive this assumption and find another algorithm with the same approximation factor, which computes the answer in the sublinear expected time.

Cites

  • No record.

    • References

  • No record.

    • Cite

    APA: Copy

    Abam, M.A., & BAHRAMI, M.R.. (2021). Computing Colored Average Degree of Graphs in Sublinear Time. NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR, 19(2 ), 143-148. SID. https://sid.ir/paper/410961/en

    Vancouver: Copy

    Abam M.A., BAHRAMI M.R.. Computing Colored Average Degree of Graphs in Sublinear Time. NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR[Internet]. 2021;19(2 ):143-148. Available from: https://sid.ir/paper/410961/en

    IEEE: Copy

    M.A. Abam, and M.R. BAHRAMI, “Computing Colored Average Degree of Graphs in Sublinear Time,” NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR, vol. 19, no. 2 , pp. 143–148, 2021, [Online]. Available: https://sid.ir/paper/410961/en

    Related Journal Papers

  • No record.

    • Related Seminar Papers

  • No record.

    • Related Plans

  • No record.

    • Recommended Workshops






    Move to top