Uncertain vertex coloring problem
From MaRDI portal
Publication:2001167
DOI10.1007/s00500-017-2861-7zbMath1415.05153MaRDI QIDQ2001167
Jin Peng, Lin Chen, Dan A. Ralescu
Publication date: 2 July 2019
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-017-2861-7
vertex coloring problem; uncertain graph; uncertain chromatic set; degree of belief rule; maximal uncertain independent vertex set; maximum separation degree algorithm
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
05C72: Fractional graph theory, fuzzy graph theory
Related Items
Vertex coloring of a graph for memory constrained scenarios, First hitting time of uncertain random renewal reward process and its application in insurance risk process, Entropy-based multi-item solid transportation problems with uncertain variables, Radio fuzzy graphs and assignment of frequency in radio stations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fuzzy colouring of fuzzy graphs
- On the minimum and maximum selective graph coloring problems in some graph classes
- A memetic algorithm for the minimum sum coloring problem
- Average-case complexity of backtrack search for coloring sparse random graphs
- Coloring fuzzy circular interval graphs
- Euler index in uncertain graph
- On distribution function of the diameter in uncertain graph
- A coloring fuzzy graph approach for image classification
- The labeled maximum matching problem
- A note on coloring sparse random graphs
- A memetic algorithm for graph coloring
- The four-colour theorem
- Fuzzy \(\phi\)-tolerance competition graphs
- An uncertain chromatic number of an uncertain graph based on \(\alpha \)-cut coloring
- Exact and heuristic methods to maximize network lifetime in wireless sensor networks with adjustable sensing ranges
- Tree index of uncertain graphs
- A theoretical extension on the operational law for monotone functions of uncertain variables
- Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams
- A Metaheuristic Approach for the Vertex Coloring Problem
- Vertex-coloring of fuzzy graphs: A new approach
- A survey on vertex coloring problems
- CONNECTEDNESS INDEX OF UNCERTAIN GRAPH
- Every planar map is four colorable
- An Improved DSATUR‐Based Branch‐and‐Bound Algorithm for the Vertex Coloring Problem
- A new approach for determining fuzzy chromatic number of fuzzy graph
- Fuzzy sets
- Random Graphs
- Uncertainty theory
- The chromatic number of random graphs
