Uncertain measure and its application in minimum weighted maximal matching problem

DOI10.22130/SCMA.2022.552238.1098OpenAlexW4372620530MaRDI QIDQ5040503FDOQ5040503

Mehdi Djahangiri

Publication date: 17 October 2022

Full work available at URL: https://doaj.org/article/4739703e112f48e48f49d8a282041954

Recommendations

• On the matching number of an uncertain graph
• Uncertain weighted dominating set: a prototype application on natural disaster relief management
• The maximum fuzzy weighted matching models and hybrid genetic algorithm
• Matching index of an uncertain graph: concept and algorithm
• Uncertain distribution-minimum spanning tree problem

zbMATH Keywords

graphinteger programminguncertainty theorymaximal matching

Mathematics Subject Classification ID

Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70) Graph theory (05Cxx)

Cites Work

• Restricted power domination and zero forcing problems
• The complexity of total edge domination and some related results on trees
• Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs
• Popular Matching in Roommates Setting Is NP-hard
• Modelling and solving the perfect edge domination problem
• Shrinking Trees not Blossoms: A Recursive Maximum Matching Approach

This page was built for publication: Uncertain measure and its application in minimum weighted maximal matching problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5040503)