[PDF][PDF] Survey of trees, forests, and paths in fuzzy and neutrosophic graphs
T Fujita - 2024 - philarchive.org
In this paper, we conduct a comprehensive study of Trees, Forests, and Paths within the
framework of Fuzzy and Neutrosophic Graphs. Graph theory, known for its wide-ranging …
framework of Fuzzy and Neutrosophic Graphs. Graph theory, known for its wide-ranging …
MIP formulations for induced graph optimization problems: a tutorial
Given a graph G=(V, E) G=(V,E) and a subset of its vertices V′⊆ VV^′⊆V, the subgraph
induced by V′ V^′ in G is that with vertex set V′ V^′ and edge set E′ E^′ formed by …
induced by V′ V^′ in G is that with vertex set V′ V^′ and edge set E′ E^′ formed by …
A biased random-key genetic algorithm for the minimum quasi-clique partitioning problem
Abstract Let G=(V, E) be a graph with vertex set V and edge set E, and consider γ∈[0, 1) to
be a real constant. A γ-clique (or quasi-clique) is a subset V′⊆ V inducing a subgraph of G …
be a real constant. A γ-clique (or quasi-clique) is a subset V′⊆ V inducing a subgraph of G …
Maximum weighted induced forests and trees: new formulations and a computational comparative review
Given a graph with a weight associated with each vertex, the maximum weighted induced
forest problem (MWIF) consists of encountering a maximum weighted subset of the vertices …
forest problem (MWIF) consists of encountering a maximum weighted subset of the vertices …
Finding the most degree-central walks and paths in a graph: Exact and heuristic approaches
In network analysis, node centrality is used to quantify the importance of a node to the
structure of the network. One of the most natural and widely used centrality measures is …
structure of the network. One of the most natural and widely used centrality measures is …
The minimum quasi-clique partitioning problem: Complexity, formulations, and a computational study
Given a simple graph G=(V, E) and a real constant γ∈(0, 1], a γ-clique (or γ-quasi-clique) is
a subset V′⊆ V inducing a subgraph with edge density at least γ. The minimum quasi …
a subset V′⊆ V inducing a subgraph with edge density at least γ. The minimum quasi …
New formulations and branch-and-cut procedures for the longest induced path problem
Given an undirected graph G=(V, E), the longest induced path problem (LIPP) consists of
obtaining a maximum cardinality subset W⊆ V such that W induces a simple path in G. In …
obtaining a maximum cardinality subset W⊆ V such that W induces a simple path in G. In …
Design and implementation of intelligent gateway system for monitoring livestock and poultry feeding environment based on bluetooth low energy
Y Du, G Sun, B Zheng, Y Qu - Information, 2021 - mdpi.com
This article proposes a gateway system design method applied to the monitoring of a
breeding environment based on Bluetooth low energy consumption. Through the queue …
breeding environment based on Bluetooth low energy consumption. Through the queue …
An experimental study of ILP formulations for the longest induced path problem
Given a graph G=(V, E), the LongestInducedPath problem asks for a maximum cardinality
node subset W ⊆ V such that the graph induced by W is a path. It is a long established …
node subset W ⊆ V such that the graph induced by W is a path. It is a long established …
Exact methods for the longest induced cycle problem
The longest induced (or chordless) cycle problem is a graph problem classified as NP-
complete and involves the task of determining the largest possible subset of vertices within a …
complete and involves the task of determining the largest possible subset of vertices within a …