Edge covering problem under hybrid uncertain environments
From MaRDI portal
Publication:371513
DOI10.1016/j.amc.2012.11.096zbMath1272.05162OpenAlexW1977459974MaRDI QIDQ371513
Publication date: 10 October 2013
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2012.11.096
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)
Related Items (2)
Solving equilibrium standby redundancy optimization problem by hybrid PSO algorithm ⋮ Set-weighted games and their application to the cover problem
Cites Work
- Unnamed Item
- Edge covering pseudo-outerplanar graphs with forests
- Edge cover by connected bipartite subgraphs
- On the roots of edge cover polynomials of graphs
- Fuzzy minimum weight edge covering problem
- Equivalence between the minimum covering problem and the maximum matching problem
- Depedent-chance programming: A class of stochastic optimization
- Fuzzy random variables - I. Definitions and theorems
- Fuzzy random variables - II. Algorithms and examples for the discrete case
- A genetic algorithm for the set covering problem
- Constrained weighted matchings and edge coverings in graphs
- Theory and practice of uncertain programming
- Uncertainty theory. An introduction to its axiomatic foundations.
- Chance-Constrained Programming
- An Algorithm for a Minimum Cover of a Graph
- A 1-matching blossom-type algorithm for edge covering problems
- An efficient algorithm for minimumk-covers in weighted graphs
- Fuzzy sets
- Minimum Covers of Fixed Cardinality in Weighted Graphs
- Expected Value Operator of Random Fuzzy Variable and Random Fuzzy Expected Value Models
- Minimum cost edge subset covering exactly \(k\) vertices of a graph
This page was built for publication: Edge covering problem under hybrid uncertain environments
