Graph coloring algorithm, graph
2016-08-23
1 0 0
no vote
Other
Earn points
Includes simulated annealing algorithm and graph coloring algorithm. % function [f wf zwf]=BGf(C,b)
Minimum cost maximum flow rate of a given graph
% C;% arc capacities
% B;% on the arc flow cost
% F minimum cost maximum flow matrices, WF zwf maximum flow minimum cost
2:% graph coloring (Graph Colouring Problem) annealing algorithm
%GCP problem can be seen to divide the vertices for the minimum number of independent set problem
%
% Solve this problem there are two algorithms
%GCPanneal1 work for degree less than 20 scenarios
%GCPanneal2 applicable to various degrees
% GCPanneal1, w (I) represents the value given the right color I
%N for the size of the problem, node number; b incidence matrix
%Lamda is a number greater than 1 penalty factor
%D degree of a graph g is maximum and minimum shaded upper bound for d+1
%E (u) u% by color
%C (I) said the number of vertex colors I%
%
%L preferable to
Minimum cost maximum flow rate of a given graph
% C;% arc capacities
% B;% on the arc flow cost
% F minimum cost maximum flow matrices, WF zwf maximum flow minimum cost
2:% graph coloring (Graph Colouring Problem) annealing algorithm
%GCP problem can be seen to divide the vertices for the minimum number of independent set problem
%
% Solve this problem there are two algorithms
%GCPanneal1 work for degree less than 20 scenarios
%GCPanneal2 applicable to various degrees
% GCPanneal1, w (I) represents the value given the right color I
%N for the size of the problem, node number; b incidence matrix
%Lamda is a number greater than 1 penalty factor
%D degree of a graph g is maximum and minimum shaded upper bound for d+1
%E (u) u% by color
%C (I) said the number of vertex colors I%
%
%L preferable to
matlab
算法
相关
着色
Related Source Codes
GMSK Linear Receiver
0
0
no vote
NSGA-II algorithm
0
0
no vote
NSGA-III multi-objective optimization algorithm
0
0
no vote
Compressed sensing example
0
0
no vote
CFAR detector example
0
0
no vote
No comment