Results 11 to 20 of about 227,714 (275)
Data‐driven performance metrics for neural network learning
International Journal of Adaptive Control and Signal Processing, EarlyView., 2023 Summary Effectiveness of data‐driven neural learning in terms of both local mimima trapping and convergence rate is addressed. Such issues are investigated in a case study involving the training of one‐hidden‐layer feedforward neural networks with the extended Kalman filter, which reduces the search for the optimal network parameters to a state ...
Angelo Alessandri +2 more
wiley +1 more source
End‐faithful spanning trees in graphs without normal spanning trees [PDF]
Journal of Graph Theory, 2022 AbstractSchmidt characterised the class of rayless graphs by an ordinal rank function, which makes it possible to prove statements about rayless graphs by transfinite induction. Halin asked whether Schmidt's rank function can be generalised to characterise other important classes of graphs. In this paper, we address Halin's question: we characterise an
Carl Bürger, Jan Kurkofka
openaire +2 more sources
Patria Artha Technological Journal, 2022 Sebagai salah satu jenis UKM dibidang kuliner, Thai Tea Azka dihadapkan dengan berbagai persoalan optimalisasi manajemen sumber daya. Dalam persoalan penugasan karyawan Thai Tea Azka mengalami kendala dalam penempatan tiap karyawan karena belum memiliki ...
Fauzan As Habi +2 more
doaj +1 more source
Connectivity index in neutrosophic trees and the algorithm to find its maximum spanning [PDF]
Neutrosophic Sets and Systems, 2020 In this paper, we first define the Neutrosophic tree using the concept of the strong cycle. We then define a strong spanning Neutrosophic tree. In the following, we propose an algorithm for detecting the maximum spanning tree in Neutrosophic graphs. Next,
Masoud Ghods, Zahra Rostami
doaj +1 more source
Linking and Cutting Spanning Trees [PDF]
Algorithms, 2018 We consider the problem of uniformly generating a spanning tree for an undirected connected graph. This process is useful for computing statistics, namely for phylogenetic trees. We describe a Markov chain for producing these trees. For cycle graphs, we prove that this approach significantly outperforms existing algorithms.
Russo, Luís M. S. +2 more
openaire +6 more sources
Clustered Spanning Tree - Conditions for Feasibility [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Let H =< V, S > be a hypergraph, where V is a set of vertices and S is a set of not necessarily disjoint clusters Si ⊆ V. The Clustered Spanning Tree problem is to find a spanning tree of G which satisfies that each cluster induces a subtree, when it ...
Nili Guttmann-Beck +2 more
doaj +1 more source
Breaking intractability of spanning caterpillar tree problem: A logical approach [PDF]
AUT Journal of Mathematics and Computing, 2022 In this paper we pursue a logical approach to prove that the optimisation problem of finding a spanning caterpillar tree in a graph has polynomial algorithm for bounded tree width graphs.
Masoud Khosravani
doaj +1 more source
On the Number of Spanning Trees of Graphs [PDF]
The Scientific World Journal, 2014 We establish some bounds for the number of spanning trees of connected graphs in terms of the number of vertices(n), the number of edges(m), maximum vertex degree(Δ1), minimum vertex degree(δ), first Zagreb index(M1),and Randić index(R-1).
Bozkurt, S. Burcu, Bozkurt, Durmus
openaire +5 more sources
Degree Sum Condition for the Existence of Spanning k-Trees in Star-Free Graphs
Discussiones Mathematicae Graph Theory, 2022 For an integer k ≥ 2, a k-tree T is defined as a tree with maximum degree at most k. If a k-tree T spans a graph G, then T is called a spanning k-tree of G.
Furuya Michitaka +5 more
doaj +1 more source
Determining hop-constrained spanning trees with repetitive heuristics
Journal of Telecommunications and Information Technology, 2023 The hop-constrained minimum spanning tree problem is the problem of determining a rooted spanning tree of minimum cost in which each path from the root node to any other node contains at most H hops or edges.
Manuela Fernandes +2 more
doaj +1 more source