|
|
|
|
| LEADER |
01788nam a2200301 a 4500 |
| 001 |
c000175332 |
| 003 |
CARM |
| 005 |
19941226000000.0 |
| 008 |
940714s1994 gw a 001 0 eng |
| 010 |
|
|
|a 94031558
|
| 019 |
1 |
|
|a 11082747
|5 LACONCORD2021
|
| 020 |
|
|
|a 0387583564
|
| 020 |
|
|
|a 3540583564
|
| 035 |
|
|
|a (OCoLC)30894945
|5 LACONCORD2021
|
| 040 |
|
|
|a TOC
|b eng
|c TOC
|
| 050 |
|
0 |
|a QA166.2
|b .K58 1994
|
| 082 |
0 |
0 |
|a 511/.5
|2 20
|
| 100 |
1 |
|
|a Kloks, Ton.
|
| 245 |
1 |
0 |
|a Treewidth :
|b computations and approximations /
|c Ton Kloks.
|
| 260 |
|
|
|a Berlin ;
|a New York :
|b Springer-Verlag,
|c c1994.
|
| 300 |
|
|
|a ix, 209 p. :
|b ill. ;
|c 24 cm.
|
| 440 |
|
0 |
|a Lecture notes in computer science ;
|v 842.
|
| 504 |
|
|
|a Includes bibliographical references (p. [193]-206) and index.
|
| 505 |
0 |
|
|a 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.
|
| 650 |
|
0 |
|a Trees (Graph theory)
|x Data processing.
|
| 852 |
8 |
|
|b CARM
|h A2:AL21B0
|i B05660
|p 0239256
|f BK
|
| 999 |
f |
f |
|i 12f97bee-1560-5ca0-bd07-48bb78175586
|s 15e3d227-d4b3-523a-a6f8-13e31d981ac9
|
| 952 |
f |
f |
|p Can circulate
|a CAVAL
|b CAVAL
|c CAVAL
|d CARM 1 Store
|e B05660
|f A2:AL21B0
|h Other scheme
|i book
|m 0239256
|