Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width.
Saved in:
| Title: | Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width. |
|---|---|
| Authors: | Courcelle, B., Makowsky, J. A., Rotics, U. |
| Source: | Theory of Computing Systems. Mar/Apr2000, Vol. 33 Issue 2, p125. 26p. |
| Subjects: | Decomposition method, Algorithms |
| Abstract: | Discusses the development of applications for graphs of clique-width and cographs. Theorems; Graph presentations for logically oriented work; Linear algorithms for optimization problems on P[sub 4]-sparse graphs. |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | Discusses the development of applications for graphs of clique-width and cographs. Theorems; Graph presentations for logically oriented work; Linear algorithms for optimization problems on P[sub 4]-sparse graphs. |
|---|---|
| ISSN: | 14324350 |
| DOI: | 10.1007/s002249910009 |
