نتایج جستجو برای: dfs

تعداد نتایج: 4607  

Journal: :Jurnal Ilmiah Matematika dan Pendidikan Matematika 2019

Journal: :Geophysical Research Letters 2022

Substorms are a fundamental phenomenon in planetary magnetospheric systems. Using Cassini measurements, we report typical event which four successive dipolarization fronts (DFs) were observed within 1 hour during the substorm Saturn's magnetotail. The last three DFs caused type of stepwise electron acceleration and generated energetic electrons. pitch angle distributions electrons show evidence...

Journal: :J. Comput. Syst. Sci. 2017
Sankardeep Chakraborty Venkatesh Raman S. Srinivasa Rao

We consider space efficient implementations of some classical applications of DFS including the problem of testing biconnectivity and 2-edge connectivity, finding cut vertices and cut edges, computing chain decomposition and st-numbering of a given undirected graphG on n vertices and m edges. Classical algorithms for them typically use DFS and some Ω(lgn) bits1 of information at each vertex. Bu...

Journal: :CoRR 2016
Lijie Chen Ran Duan Ruosong Wang Hanrui Zhang

Depth first search (DFS) tree is one of the most well-known data structures for designing efficient graph algorithms. Given an undirected graph G = (V,E) with n vertices and m edges, the textbook algorithm takes O(n + m) time to construct a DFS tree. In this paper, we study the problem of maintaining a DFS tree when the graph is undergoing updates. Formally, we show the following results. • Inc...

2016
Surender Baswana Shreejit Ray Chaudhury Keerti Choudhary Shahbaz Khan

Given an undirected graph G = (V, E) on n vertices and m edges, we address the problem of maintaining a DFS tree when the graph is undergoing updates (insertion and deletion of vertices or edges). We present the following results for this problem. 1. Fault tolerant DFS tree: There exists a data structure of size˜O(m) 1 such that given any set F of failed vertices or edges, a DFS tree of the gra...

Journal: :Information Sciences 2022

• A novel and efficient semi-external DFS algorithm EP-DFS is presented. requires simpler CPU calculation less memory space. index devised to reduce the disk random accesses. Extensive experiments are conducted on both real synthetic datasets . As graphs grow in size, many real-world difficult load into primary of a computer. Thus, computing depth-first search (DFS) results (i.e., order or DFS-...

Journal: :Pediatric dentistry 2008
Felicia Trachtenberg Nancy Nairi Maserejian Mary Tavares Jennifer Ann Soncini Catherine Hayes

PURPOSE The purpose of this study was to assess the relationship between baseline caries experience and the restoration replacement rate in children. METHODS The 5-year New England Children's Amalgam Trial recruited 534 6- to 10-year-old children with 2 or more carious posterior teeth. The association between decoy and longevity of restorations was assessed. Restorations with no follow-up (N ...

Journal: :Journal of Graph Algorithms and Applications 2003

Journal: :Journal of applied physiology 2005
Antonios Kyparos Daniel L Feeback Charles S Layne Daniel A Martinez Mark S F Clarke

Unloading-induced muscle atrophy occurs in the aging population, bed-ridden patients, and astronauts. This study was designed to determine whether dynamic foot stimulation (DFS) applied to the plantar surface of the rat foot can serve as a countermeasure to soleus muscle atrophy normally observed in hindlimb unloaded (HU) rats. Forty-four mature (6 mo old), male Wistar rats were randomly assign...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید