Results 231 to 240 of about 186,232 (291)

Disorder‐Driven Fast Na+ Transport: From Crystalline to Amorphous Networks in the Mixed‐Anion NaTaOxCl6−2x Oxychlorides

open access: yesAdvanced Energy Materials, EarlyView.
Oxygen substitution in NaTaOxCl6‐2x drives structural evolution from isolated [TaCl6]– octahedra, through oxygen‐bridged [Ta2OCl10]2– dimers, toward extended trans‐[TaO2Cl4]3– chain‐like arrangements. At intermediate compositions, zero‐dimensional corner‐sharing motifs are proposed to create a flexible, disordered framework that peaks ionic ...
Justin Leifeld   +17 more
wiley   +1 more source

Finding Minimum Spanning Trees

SIAM Journal on Computing, 1976
This paper studies methods for finding minimum spanning trees in graphs. Results include 1. several algorithms with $O(m\log \log n)$ worst-case running times, where n is the number vertices and m is the number of edges in the problem graph; 2. an $O(m)$ worst-case algorithm for dense graphs (those for which m is $\Omega (n^{1 + \varepsilon } )$ for ...
Cheriton, David, Tarjan, Robert Endre
openaire   +2 more sources

Minimum Spanning Trees

2019
The atoll of Taka-Tuka-Land in the South Seas asks you for help. The people want to connect their islands by ferry lines. Since money is scarce, the total cost of the connections is to be minimized. It needs to be possible to travel between any two islands; direct connections are not necessary. You are given a list of possible connections together with
Peter Sanders   +3 more
openaire   +1 more source

Home - About - Disclaimer - Privacy