The Depth First Search (DFS) algorithm is one of the basic techniques which is used in a very large variety of graph algorithms. Most applications of the DFS involve the construction of a depth-first spanning tree (DFS tree). In this paper, we give a complete characterization of all the graphs in which every spanning tree is a DFS tree. These graphs are called Total −DFS −Graphs. We prove that ...

Epidemiological studies have investigated the association between vitamin D pathway genes and breast cancer risk; however, little is known about the association between vitamin D pathway genes and breast cancer prognosis. In a retrospective cohort of 1029 patients with early-stage breast cancer, we analyzed the association between 106 tagging single nucleotide polymorphisms (SNPs) in eight vita...

OBJECTIVES Recent studies have suggested that postoperative complications could have a potential negative effect on long-term outcome after oesophagectomy for cancer. Because respiratory failures represent the most frequent postoperative complication, we have investigated the prognostic impact of these complications on disease-free survival (DFS). METHODS From a prospective single-institution...

Passenger train delay significantly influences riders’ decision to choose rail transport as their mode choice. This article proposes real-time passenger prediction (PTDP) models using the following machine learning techniques: random forest (RF), gradient boosting (GBM), and multi-layer perceptron (MLP). In this article, impact on PTPD Real-time based Data-frame Structure (RT-DFS) with H...

DFS has previously been shown to be a simple and efficient strategy for removing cycles in graphs allowing the resulting DAGs to be scheduled using one of the many well-established DAG multiprocessor scheduling algorithms. In this paper, we investigate the inefficiencies of schedules acquired using DFS cycle removal. Further, an improved randomised DFS cycle removal algorithm is proposed that p...

Recent emphasis on dipolarization fronts (DFs) has led to the impression that DFs play a significant role in bringing magnetic flux to the inner magnetosphere during substorms. In this work, we investigate the amount of magnetic flux transport associated with DFs by examining the frozen-in field line condition (FIC) for previously reported DF events. A study of 18 DF cases shows that the FIC do...

Depth first search (DFS) tree is a fundamental data structure for solving various problems in graphs. It is well known that it takes O(m+ n) time to build a DFS tree for a given 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...

The aim of the present study is to assess the disease profile, outcome and prognostic factors in patients treated with surgery combined with radiotherapy (RT), with or without chemotherapy (CXT), for soft-tissue sarcoma (STS) in a multidisciplinary setting. One hundred and sixty-four patients with STS treated between 1980 and 2010 at the Centre Hospitalier Universitaire Vaudois were enrolled in...