Document Details

Document Type : Article In Journal 
Document Title :
Classical graphs decomposition and their totally decomposable graphs
تحليل الرسوم الكلاسيكية وتحليلها العام
 
Subject : Computer Science 
Document Language : English 
Abstract : In solving optimization problems on graphs, graph decomposition is considered to be a powerful tool for obtaining efficient solutions for these problems. Totally decomposable graphs with respect to some method of graphs decomposition are relevant to many different areas of applied mathematics and computer science. There is a considerable number of results in this area. The goal of this paper is to survey the state of art of the famous methods of graphs decomposition and their totally decomposable graphs. 
ISSN : 1738-7906 
Journal Name : International Journal of Computer Science and Network Security 
Volume : 10 
Issue Number : 1 
Publishing Year : 1430 AH
2010 AD 
Article Type : Article 
Added Date : Saturday, February 5, 2011 

Researchers

Researcher Name (Arabic)Researcher Name (English)Researcher TypeDr GradeEmail
رزين قدورهQuaddoura, Ruzayn ResearcherDoctoraterquaddoura@kau.edu.sa

Files

File NameTypeDescription
 28839.pdf pdf Classical graphs decomposition and their totally decomposable graph
 28840.pdf pdfIJCSNS - International Journal of Computer Science and Network Security

Back To Researches Page