The problem of enumerating connected induced subgraphs a given graph is classical and studied well. It known that can be enumerated in constant time for each subgraph. In this paper, we focus on highly subgraphs. most major concept connectivity graphs vertex connectivity. For connectivity, some enumeration settings algorithms have been proposed, such as k-vertex spanning another edge-connectivi...

The bounded delay buffer management problem, which was proposed by Kesselman et al. (STOC 2001 and SIAM Journal on Computing 33(3), 2004), is an online problem focusing of a switch supporting Quality Service (QoS). definition as follows: Packets arrive to over time each packet specified the release time, deadline value. An algorithm can transmit at most one from integer gain its value profit if...

background : there are few published studies that use real data testing to examine the performance of outbreak detection methods. the aim of this study was to determine the performance of the exponentially weighted moving average (ewma) in real time detection of a local outbreak in mashhad city, eastern iran . methods : the ewma algorithms (both ewma 1 with λ=0.3 and ewma 2 with λ=0.6) were app...

cardiovascular diseases are one of the most common diseases that cause a large number of deaths each year. coronary artery disease (cad) is the most common type of these diseases worldwide and is the main reason of heart attacks. thus early diagnosis of cad is very essential and is an important field of medical studies. many methods are used to diagnose cad so far. these methods reduce cost and...