This paper presents a lower bound of (D + n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of ...
Priority scheduling for packets is becoming a hot topic, as attemps are being made to integrate voice services in existing data networks. In this paper, we consider a discrete-tim...
Operations Research is probably one of the most successful fields of applied mathematics used in Economics, Physics, Chemistry, almost everywhere onehastoanalyzehugeamountsofdata.L...
Abstract. Discovery of evolving regions in large graphs is an important issue because it is the basis of many applications such as spam websites detection in the Web, community lif...
Multi-path routing is effective to enhance network availability, by selecting multiple failure-independent paths for reaching one destination in the hope to survive individual pat...