Results 251 to 260 of about 139,243 (275)
Some of the next articles are maybe not open access.
Completely independent spanning trees in torus networks
Networks, 2011AbstractLet T1, T2, …, Tk be spanning trees in a graph G. If for any two vertices u, v in G, the paths from u to v in T1, T2, …, Tk are pairwise internally disjoint, then T1, T2, …, Tk are completely independent spanning trees in G. Completely independent spanning trees can be applied to fault‐tolerant communication problems in interconnection networks.
Hasunuma, Toru, Morisaka, Chie
openaire +2 more sources
Independent Spanning Trees on Multidimensional Torus Networks
IEEE Transactions on Computers, 2010Two spanning trees rooted at vertex r in a graph G are called independent spanning trees (ISTs) if for each vertex v in G, vner, the paths from vertex v to vertex r in these two trees are internally distinct. If the connectivity of G is k, the IST problem is to construct k ISTs rooted at each vertex.
Tang, S. M. +3 more
openaire +2 more sources
Dominators, Directed Bipolar Orders, and Independent Spanning Trees
2012We consider problems related to dominators and independent spanning trees in flowgraphs and provide linear-time algorithms for their solutions. We introduce the notion of a directed bipolar order, generalizing a previous notion of Plein and Cheriyan and Reif.
Loukas Georgiadis, Robert E. Tarjan
openaire +1 more source
Integrative oncology: Addressing the global challenges of cancer prevention and treatment
Ca-A Cancer Journal for Clinicians, 2022Jun J Mao,, Msce +2 more
exaly
Multidisciplinary standards of care and recent progress in pancreatic ductal adenocarcinoma
Ca-A Cancer Journal for Clinicians, 2020Aaron J Grossberg +2 more
exaly
Oral complications of cancer and cancer therapy
Ca-A Cancer Journal for Clinicians, 2012Joel B Epstein +2 more
exaly
American Cancer Society Head and Neck Cancer Survivorship Care Guideline
Ca-A Cancer Journal for Clinicians, 2016Nader Sadeghi +2 more
exaly