JSP Page
         
 
     
   
   
 
 
 
JSP Page
   LOs / ANIMATIONS
All UG/PG LOs/ANIMATIONS
Biochemistry
Biology
Bioscience and Engineering
Chemical Engineering
Chemistry
Civil Engineering
Computer Science
Earth Science
Electrical Engineering
Electronics
Environmental Science
Mechanical Engineering
Metallurgical Engineering
Physics
MHRD LOs/ANIMATIONS
     
 
   
  Electrical Engineering
(Note: Please click on Run to view Animation directly)
   
 
 
         
 
 
TitleThe Party Problem
LevelUnder Graduate
Course:Graph Theory
Summary:The simplest example of Ramsey theory. It is also known as the 'Maximum Clique Problem'. A clique of a graph is a complete sub graph of the main graph, and the clique of largest possible size is referred to as a maximum clique
KeywordsThe Party Problem
Language: English
  
   
Other Details
Last modified on:2012-04-03 09:50:38.278038
   
Credits
IDD writer:Phani Swathi Chitta
Mentor:Prof. Saravanan Vijayakumaran
Developer:Aruna Adil
  Download Instructional Design Document    
 
 
 
 
  Back to Previous  
Untitled Document
 
Hit Counter
Since Jan, 2010
Feedback Contact Us  
        The contents in this page is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 2.5 India license. While Project Oscar has taken best effort in preparing the contents, we have no warranties with respect to the accuracy or completeness of the content.