Zobrazeno 1 - 10
of 6 721
pro vyhledávání: '"Tree (graph theory)"'
Publikováno v:
Jurnal Lebesgue, Vol 5, Iss 2, Pp 1126-1134 (2024)
Efficiency in the use of electricity is a necessity for the sustainability of a better life. Almost all human activities utilize electrical energy, such as household appliances, industry, and even vehicles. This research contains the efficiency of el
Externí odkaz:
https://doaj.org/article/3a0e2f998b484972971e91fb8c6f2a59
Autor:
Pablo De Caria
Publikováno v:
Discrete Applied Mathematics. 323:171-183
This paper is inspired by the well known characterization of chordal graphs as the intersection graphs of subtrees of a tree. We consider families of induced trees of any graph and we prove that their recognition is NP-Complete. A consequence of this
Autor:
P K Neethu, S V Ullas Chandran
Publikováno v:
Discrete Applied Mathematics. 319:480-486
A set of vertices S of a graph G is a (geodesically) convex set, if S contains all the vertices belonging to any shortest path connecting two vertices of S . The cardinality of a maximum proper convex set of G is called the convexity number, con ( G
Publikováno v:
Annals of Operations Research. 323:109-129
We introduce the two-step average tree value for transferable utility games with restricted cooperation represented by undirected communication graphs or hypergraphs. The solution can be considered as an alternative for both the average tree solution
Publikováno v:
IEEE/ACM Transactions on Computational Biology and Bioinformatics. 19:2642-2653
Phylogenetic analyses commonly assume that the species history can be represented as a tree. However, in the presence of hybridization, the species history is more accurately captured as a network. Despite several advances in modeling phylogenetic ne
Publikováno v:
IEEE Transactions on Knowledge and Data Engineering. 34:4313-4327
Community search that finds query-dependent communities has been studied on various kinds of graphs. As one instance of community search, intimate-core group (community) search over a weighted graph is to find a connected k-core containing all query
Autor:
Rohan Ghuge, Viswanath Nagarajan
Publikováno v:
Mathematics of Operations Research. 47:1612-1630
We consider the following general network design problem. The input is an asymmetric metric (V, c), root [Formula: see text], monotone submodular function [Formula: see text], and budget B. The goal is to find an r-rooted arborescence T of cost at mo
Autor:
Tanzy Love, Matthew Corsetti
Publikováno v:
Pattern Anal Appl
The Random Subspace Method (RSM) is an ensemble procedure in which each constituent learner is constructed using a randomly chosen subset of the data features. Regression trees are ideal candidate learners in RSM ensembles. By constructing trees upon
Publikováno v:
IEEE Transactions on Industrial Electronics. 69:3854-3864
This paper introduces a secure tunnel fast marching tree motion planning algorithm (ST-FMT*) to provide a secure and optimal path quickly for a mobile robot. The proposed ST-FMT* consists of preprocessing and exploring procedures, which are responsib
Publikováno v:
Discrete Applied Mathematics. 309:46-67
Fault diagnosis plays an important role in maintaining the reliability of interconnection networks. Let v be a given node in an interconnection network G . v is conditionally locally t -diagnosable in G if the fault or fault-free status of node v can