Home  |  About Us  |  Link To Us  |  FAQ  |  Contact

Heuristic Algorithm for finding Maximum Independent Set 1.0

Date Added: August 19, 2013  |  Visits: 270

findMIS is an heuristic algorithm for solving Maximum Independent Set problem (MIS).An independent set of a graph is a subset of vertices in which no two vertices areadjacent. Given a set of vertices, the maximum independent set problem callsfor finding the independent set of maximum cardinality.Algorithm run in O(n^2) time, where n is the number of vertices (worst case).Experimentally: time = 8.1e-007*n^2 + 2.2e-005*n + 0.00012 seconds, (see screenshot)The algorithm has been independently developped but is similar to:Balaji, Swaminathan, Kannan, "A Simple Algorithm to OptimizeMaximum Independent Set", Advanced Modeling and Optimization, Volume 12, Number 1, 2010 Notation:The neighborhood of v is defined by N(v) ={u in V such that u is adjacent to v}The DEGREE of a vertex v in V, denoted by deg(v) and is defined by the number ofneighbors of v.The SUPPORT of a vertex v in V is defined by the sum of the degree of the verticeswhich are adjacent to v, i.e., support(v) = s(v) = sum( deg(u) ) where u are allvertices in N(v). INPUTS:"AD" is the adjacency matrix. It must be of logical values!"priority" is used to break the ties (parity) situations that occur when more than one maximum independent set can be selected. Consider for example the trivial case of two nodes connected by one edge: there are two possible maximum independent sets. By using priority you can decide which vertex has to selected first. Try for example:x=findMIS(logical([0 1; 1 0]),[1 2]) %Higher priority to node 1andx=findMIS(logical([0 1; 1 0]),[2 1]) %Higher priority to node 2 OUTPUTS:x is an binary array where x(i)=1 if vertex i belongs to the Maximum independent setand x(i)=0 if belongs to the Minimum vertex cover.

 Requirements: No special requirements Platforms: Matlab Keyword: 81e007n2 2b,  Adjacency Matrix,  Adjacent,  Advanced Modeling,  Algorithm,  Allvertices,  And Is,  Be Of,  Belongs,  Binary,  Binary Array,  Break,  But Is,  Heuristic,  Independently,  Optimization,  Selected Users rating: 0/10

USER REVIEWS
 More Reviews or Write Review
HEURISTIC ALGORITHM FOR FINDING MAXIMUM INDEPENDENT SET RELATED
 Programming  -  Chart::Math::Axis 1.05 Chart::Math::Axis implements in a generic way an algorithm for finding a set of ideal values for an axis. That is, for any given set of data, what should the top and bottom of the axis scale be, and what should the interval between the ticks... 30.72 KB Mathematics  -  20sim Viewer 3.3 20-sim is an advanced modeling and simulation package for Windows. With 20-sim you can simulate the behavior of dynamic systems, such as electrical, mechanical and hydraulic systems or any combination of these. 20-sim models may use iconic... 23.35 MB Development Tools  -  MINCONNECT 1.0 MINimal CONNECTivity (adjacency) matrix for (X,Y) points on a plane, and/or graph of connections. Needs CLINE.Applications: graph theory, optimal traffic, astronomy (e.g. if youwant to see a tree of connected stars selected according to certain... 10 KB Libraries  -  SPUC 2.3.1 Signal Processing using C++ (SPUC) is a C++ source code library of DSP and digital communication classes and functions useful for system modeling, software prototyping, and simulation. The objective of SPUC is to provide the Communications... 460.8 KB Multimedia & Graphics  -  20-sim 4.2.1.1 20-sim is an advanced modeling and simulation package for your operating system. With 20-sim you can simulate the behavior of dynamic systems, such as electrical, mechanical and hydraulic systems or any combination of these. 20-sim models may... Misc. Web Browser Tools  -  The Matrix Code Internet Explorer Theme .9 Bring the look of The Matrix to your Internet Explorer browser with this simple designer theme SEARCH: Our primary revenue source is BING. We will reset your default search engine when installed so please give BING a try! PRIVACY: We respect your... 674 KB Development Tools  -  Gravitational Search Algorithm (GSA) 1.0 Gravitational search algorithm (GSA) is an optimization algorithm based on the law of gravity and mass interactions.This algorithm is based on the Newtonian gravity: "Every particle in the universe attracts every other particle with a force that... 10 KB Development Tools  -  Alghorithm of Karge Thompson 1.0 The algorithm of Karge Thompson is a heuristic algorithm that allows to obtain, given a specific group of jobs to be produced, the best sequence in terms of time setup.Hypothesis:N indipendent jobs;delivery dates not relevant;preemption is not... 10 KB Development Tools  -  Modeling Variable Annuities with MATLAB 1.0 Highlights include:d-deD? Integrating data sourcesd-deD? Valuing and creating a variable annuity productd-deD? Application development and deploymentThis webinar is relevant to practitioners or academics in finance whose focus is quantitative... 911.36 KB Development Tools  -  2D random paths generator integrating leg's contraints 1.0 Generates random 2D-paths between start and finish nodes according to densities distribution given by matrix C with leg's contrainsts defined by the adjacency matrix I.P = path_generator(start , finish , I , [C] , [K] , [V] ,... 20.48 KB