Algorithms and minimal forbidden minors for tree-decomposable graphs / by Jens Lagergren
Saved in:
| Superior document: | TRITA : NA 9104 |
|---|---|
| VerfasserIn: | |
| Place / Publishing House: | Stockholm : Dep. of Num. Analysis and Comp. Sc., Royal Institute of Technology, 1991 |
| Year of Publication: | 1991 |
| Language: | English |
| Series: | TRITA : NA
9104 |
| Physical Description: | IV, 76 S. |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| LEADER | 00781nam#a2200253zcb4500 | ||
|---|---|---|---|
| 001 | 990003191380504498 | ||
| 005 | 20230503205148.0 | ||
| 007 | tu | ||
| 008 | 970618|1991####|||######m####|||#|#eng#c | ||
| 009 | AC01974239 | ||
| 035 | |a (AT-OBV)AC01974239 | ||
| 035 | |a AC01974239 | ||
| 035 | |a (Aleph)002373428ACC01 | ||
| 035 | |a (DE-599)OBVAC01974239 | ||
| 035 | |a (EXLNZ-43ACC_NETWORK)990023734280203331 | ||
| 040 | |a RET |b ger |d OAW |e rakwb | ||
| 041 | |a eng | ||
| 044 | |c XA-SE | ||
| 100 | 1 | |a Lagergren, Jens |4 aut | |
| 245 | 1 | 0 | |a Algorithms and minimal forbidden minors for tree-decomposable graphs |c by Jens Lagergren |
| 264 | 1 | |a Stockholm |b Dep. of Num. Analysis and Comp. Sc., Royal Institute of Technology |c 1991 | |
| 300 | |a IV, 76 S. | ||
| 490 | 1 | |a TRITA : NA |v 9104 | |
| 502 | |a Stockholm, Univ., Diss., 1991 | ||
| 830 | 0 | |w (AT-OBV)AC04914138 |v 9104 | |
| ADM | |b 2023-05-03 20:51:48 Europe/Vienna |d 20 |f System |c marc21 |a 2018-12-24 09:42:46 Europe/Vienna |g false | ||
| HOL | 8 | |b YWOAW |h 22305-C |c MAG1-3 |8 2219803290004498 | |
| 852 | 8 | |b YWOAW |c MAG1-3 |h 22305-C |8 2219803290004498 | |
| ITM | |9 2219803290004498 |e 1 |m BOOK |b +YW19087904 |i BNW-22305-C |2 MAG1-3 |o 19991230 |8 2319803260004498 |f 02 |p 2017-06-14 02:00:00 Europe/Vienna |h 22305-C |1 YWOAW |q 2022-06-09 12:09:19 Europe/Vienna | ||