Constructing the basis path set by eliminating the path dependency

DOI10.1007/S11424-022-0208-7zbMath1502.68249arXiv2007.00657OpenAlexW3039745655WikidataQ114222440 ScholiaQ114222440MaRDI QIDQ2109299

Yanyan Li

Publication date: 20 December 2022

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.00657

zbMATH Keywords

neural networkpath dependencybasis pathpath subdivision chainsubstructure path

Mathematics Subject Classification ID

Artificial neural networks and deep learning (68T07) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Subdivisions of graphs: A generalization of paths and cycles
• Stability and Hopf bifurcation analysis of an \((n+m)\)-neuron double-ring neural network model with multiple time delays
• A game-based approximate verification of deep neural networks with provable guarantees
• The complexity of explaining neural networks through (group) invariants
• Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs
• Arc Routing
• Learning representations by back-propagating errors
• Digraphs
• Combinatorial optimization. Theory and algorithms.

This page was built for publication: Constructing the basis path set by eliminating the path dependency