Dual-Neighborhood Search for Solving the Minimum Dominating Tree Problem
The minimum dominating tree (MDT) problem consists of finding a minimum weight subgraph from an undirected graph, such that each vertex not in this subgraph is adjacent to at least one of the vertices in it, and the subgraph is connected without any ring structures. This paper presents a dual-neighb...
Main Authors: | Ze Pan, Xinyun Wu, Caiquan Xiong |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-10-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/11/19/4214 |
Similar Items
-
Minimum Neighborhood Domination of Split Graph of Graphs
by: ANJALINE. W, et al.
Published: (2023-03-01) -
A Variable Neighborhood Search Method with a Tabu List and Local Search for Optimizing Routing in Trucks in Maritime Ports
by: Luka Matijević, et al.
Published: (2023-08-01) -
Conserving America's neighborhoods/
by: Yin, Robert K. 440367
Published: (1982) -
Planning According to New Urbanism: the Ostadsara Neighborhood Case Study
by: Nader Zali, et al.
Published: (2016-12-01) -
Assessing the Sustainability Level of Organic and Planned Neighborhoods Using UN-HABITAT Indicators
(Case Study: Noghan and Sajad Neighborhoods of Mashhad)
by: Mahmoud Jomehpour, et al.
Published: (2020-05-01)