To search, Click below search items. |
| All Published Papers Search Service |
|
|
|
Title |
Classical graphs decomposition and their totally decomposable graphs |
|
Author |
Ruzayn Quaddoura, Khalid Mansour |
| Citation |
Vol. 10 No. 1 pp. 240-250 |
|
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. |
|
Keywords |
Graph Problems, Complexity |
|
URL |
