Results 221 to 230 of about 1,608,691 (253)
Some of the next articles are maybe not open access.
The edge disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kawarabayashi, Ken-Ichi +1 more
openaire +2 more sources
An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks
2012A digraph G = (V,E) with a distinguished set T ⊆ V of terminals is called inner Eulerian if for each v ∈ V − T the numbers of arcs entering and leaving v are equal. By a T-path we mean a simple directed path connecting distinct terminals with all intermediate nodes in V − T. This paper concerns the problem of finding a maximum T-path packing, i.e.
Maxim A. Babenko +2 more
openaire +1 more source
A new continuous printing path planning method for gradient honeycomb infill structures
The International Journal of Advanced Manufacturing Technology, 2023Yamin Li +3 more
semanticscholar +1 more source
An Eulerian Path Approach to Global Multiple Alignment for DNA Sequences
J. Comput. Biol., 2003Yu Zhang, M. Waterman
semanticscholar +1 more source
Journal of Ambient Intelligence and Humanized Computing, 2018
M. Arzamendia +4 more
semanticscholar +1 more source
M. Arzamendia +4 more
semanticscholar +1 more source
Predicting cancer outcomes with radiomics and artificial intelligence in radiology
Nature Reviews Clinical Oncology, 2021Kaustav Bera +2 more
exaly
Electrified water treatment: fundamentals and roles of electrode materials
Nature Reviews Materials, 2023Kuichang Zuo +2 more
exaly
Multifunctional materials for implantable and wearable photonic healthcare devices
Nature Reviews Materials, 2020Geon-Hui Lee, Hanul Moon, Hyemin Kim
exaly