• Login
    View Item 
    •   Home
    • Research Publications
    • Engineering & Technology
    • Department of Electronics, Computing & Maths
    • View Item
    •   Home
    • Research Publications
    • Engineering & Technology
    • Department of Electronics, Computing & Maths
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of UDORACommunitiesTitleAuthorsIssue DateSubmit DateSubjectsThis CollectionTitleAuthorsIssue DateSubmit DateSubjects

    My Account

    LoginRegister

    About and further information

    AboutOpen Access WebpagesOpen Access PolicyTake Down Policy University Privacy NoticeUniversity NewsTools for ResearchersLibraryUDo

    Statistics

    Display statistics

    Optimizing K2 trees: a case for validating the maturity of network of practices

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    Publisher version
    View Source
    Access full-text PDFOpen Access
    View Source
    Check access options
    Check access options
    Thumbnail
    Name:
    CAMWA_bessis_2f.pdf
    Size:
    375.1Kb
    Format:
    PDF
    Description:
    Main article (accepted version 2)
    Download
    Authors
    Shi, Quan
    Xiao, Yanghua
    Bessis, Nik cc
    Lu, Yiqi
    Chen, Yaoliang
    Hill, Richard
    Affiliation
    Nantong University, Nantong, China, School of Computer Science and Technology
    Fudan University, Shanghai, China, School of Computer Science
    University of Derby, School of Computing and Mathematics
    Issue Date
    2012-01
    
    Metadata
    Show full item record
    Abstract
    Of late there has been considerable interest in the efficient and effective storage of large-scale network graphs, such as those within the domains of social networks, web and virtual communities. The representation of these data graphs is a complex and challenging task and arises as a result of the inherent structural and dynamic properties of a community network, whereby naturally occurring churn can severely affect the ability to optimize the network structure. Since the organization of the network will change over time, we consider how an established method for storing large data graphs (K^2 tree) can be augmented and then utilized as an indicator of the relative maturity of a community network. Within this context, we present an algorithm and a series of experimental results upon both real and simulated networks, illustrating that the compression effectiveness reduces as the community network structure becomes more dynamic. It is for this reason we highlight a notable opportunity to explore the relevance between the K^2 tree optimization factor with the maturity level of the network community concerned.
    Citation
    Optimizing trees: a case for validating the maturity of network of practices 2012, 63 (2):427 Computers & Mathematics with Applications
    Publisher
    Elsevier
    Journal
    Computers & Mathematics with Applications
    DOI
    10.1016/j.camwa.2011.07.060
    Additional Links
    http://linkinghub.elsevier.com/retrieve/pii/S0898122111006353
    Type
    Article
    ISSN
    08981221
    08981221
    ae974a485f413a2113503eed53cd6c53
    10.1016/j.camwa.2011.07.060
    Scopus Count
    Collections
    Department of Electronics, Computing & Maths

    entitlement

     
    DSpace software (copyright © 2002 - 2021)  DuraSpace
    Quick Guide | Contact Us
    Open Repository is a service operated by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.