Results 231 to 239 of about 1,569,721 (239)
Some of the next articles are maybe not open access.

On finding the Eulerian paths and circuits of a digraph

Summary: In this paper, for a finite digraph, we suggest a very simple method (with a FORTRAN program) for finding (optionally) all the Eulerian paths (or circuits) having a specified starting arc.
openaire   +1 more source

Materials challenges on the path to gigatonne CO2 electrolysis

Nature Reviews Materials
Blanca Belsa, , Viktoria Golovanova
exaly  

Home - About - Disclaimer - Privacy