Treewidth : computations and approximations /
সংরক্ষণ করুন:
| প্রধান লেখক: | |
|---|---|
| বিন্যাস: | গ্রন্থ |
| ভাষা: | English |
| প্রকাশিত: |
Berlin ; New York :
Springer-Verlag,
c1994.
|
| মালা: | Lecture notes in computer science ;
842. |
| বিষয়গুলি: |
সূচিপত্রের সারণি:
- 1. Introduction and basic terminology
- 2. Preliminaries
- 3. Testing superperfection of k-trees
- 4. Triangulating 3-colored graphs
- 5. Only few graphs have bounded treewidth
- 6. Approximating treewidth and pathwidth of a graph
- 7. Approximating treewidth and pathwidth for some classes of perfect graphs
- 8. Treewidth of chordal bipartite graphs
- 9. Treewidth and pathwidth of permutation graphs
- 10. Treewidth of circle graphs
- 11. Finding all minimal separators of a graph
- 12. Treewidth and pathwidth of cocomparability graphs of bounded dimension
- 13. Pathwidth of pathwidth-bounded graphs
- 14. Treewidth of treewidth-bounded graphs
- 15. Recognizing treewidth-bounded graphs.