Algorithms and minimal forbidden minors for tree-decomposable graphs

Algorithms and minimal forbidden minors for tree-decomposable graphs / by Jens Lagergren

Saved in:
Bibliographic Details
Superior document:TRITA : NA 9104
VerfasserIn:
Lagergren, Jens
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!
id 990003191380504498
ctrlnum AC01974239
(AT-OBV)AC01974239
(Aleph)002373428ACC01
(DE-599)OBVAC01974239
(EXLNZ-43ACC_NETWORK)990023734280203331
collection bib_alma
institution YWOAW
building MAG1-3
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00781nam#a2200253zcb4500</leader><controlfield tag="001">990003191380504498</controlfield><controlfield tag="005">20230503205148.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">970618|1991####|||######m####|||#|#eng#c</controlfield><controlfield tag="009">AC01974239</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(AT-OBV)AC01974239</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">AC01974239</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(Aleph)002373428ACC01</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)OBVAC01974239</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(EXLNZ-43ACC_NETWORK)990023734280203331</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">RET</subfield><subfield code="b">ger</subfield><subfield code="d">OAW</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="c">XA-SE</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Lagergren, Jens</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms and minimal forbidden minors for tree-decomposable graphs</subfield><subfield code="c">by Jens Lagergren</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stockholm</subfield><subfield code="b">Dep. of Num. Analysis and Comp. Sc., Royal Institute of Technology</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">IV, 76 S.</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">TRITA : NA</subfield><subfield code="v">9104</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Stockholm, Univ., Diss., 1991</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="w">(AT-OBV)AC04914138</subfield><subfield code="v">9104</subfield></datafield><datafield tag="ADM" ind1=" " ind2=" "><subfield code="b">2023-05-03 20:51:48 Europe/Vienna</subfield><subfield code="d">20</subfield><subfield code="f">System</subfield><subfield code="c">marc21</subfield><subfield code="a">2018-12-24 09:42:46 Europe/Vienna</subfield><subfield code="g">false</subfield></datafield><datafield tag="HOL" ind1="8" ind2=" "><subfield code="b">YWOAW</subfield><subfield code="h">22305-C</subfield><subfield code="c">MAG1-3</subfield><subfield code="8">2219803290004498</subfield></datafield><datafield tag="852" ind1="8" ind2=" "><subfield code="b">YWOAW</subfield><subfield code="c">MAG1-3</subfield><subfield code="h">22305-C</subfield><subfield code="8">2219803290004498</subfield></datafield><datafield tag="ITM" ind1=" " ind2=" "><subfield code="9">2219803290004498</subfield><subfield code="e">1</subfield><subfield code="m">BOOK</subfield><subfield code="b">+YW19087904</subfield><subfield code="i">BNW-22305-C</subfield><subfield code="2">MAG1-3</subfield><subfield code="o">19991230</subfield><subfield code="8">2319803260004498</subfield><subfield code="f">02</subfield><subfield code="p">2017-06-14 02:00:00 Europe/Vienna</subfield><subfield code="h">22305-C</subfield><subfield code="1">YWOAW</subfield><subfield code="q">2022-06-09 12:09:19 Europe/Vienna</subfield></datafield></record></collection>
record_format marc
spelling Lagergren, Jens aut
Algorithms and minimal forbidden minors for tree-decomposable graphs by Jens Lagergren
Stockholm Dep. of Num. Analysis and Comp. Sc., Royal Institute of Technology 1991
IV, 76 S.
TRITA : NA 9104
Stockholm, Univ., Diss., 1991
(AT-OBV)AC04914138 9104
YWOAW MAG1-3 22305-C 2219803290004498
language English
format Thesis
Book
author Lagergren, Jens
spellingShingle Lagergren, Jens
Algorithms and minimal forbidden minors for tree-decomposable graphs
TRITA : NA
author_facet Lagergren, Jens
author_variant j l jl
author_role VerfasserIn
author_sort Lagergren, Jens
title Algorithms and minimal forbidden minors for tree-decomposable graphs
title_full Algorithms and minimal forbidden minors for tree-decomposable graphs by Jens Lagergren
title_fullStr Algorithms and minimal forbidden minors for tree-decomposable graphs by Jens Lagergren
title_full_unstemmed Algorithms and minimal forbidden minors for tree-decomposable graphs by Jens Lagergren
title_auth Algorithms and minimal forbidden minors for tree-decomposable graphs
title_new Algorithms and minimal forbidden minors for tree-decomposable graphs
title_sort algorithms and minimal forbidden minors for tree-decomposable graphs
series TRITA : NA
series2 TRITA : NA
publisher Dep. of Num. Analysis and Comp. Sc., Royal Institute of Technology
publishDate 1991
physical IV, 76 S.
callnumber-raw 22305-C
callnumber-search 22305-C
illustrated Not Illustrated
work_keys_str_mv AT lagergrenjens algorithmsandminimalforbiddenminorsfortreedecomposablegraphs
status_str n
ids_txt_mv (AT-OBV)AC01974239
AC01974239
(Aleph)002373428ACC01
(DE-599)OBVAC01974239
(EXLNZ-43ACC_NETWORK)990023734280203331
hol852bOwn_txt_mv YWOAW
hol852hSignatur_txt_mv 22305-C
hol852cSonderstandort_txt_mv MAG1-3
itmData_txt_mv 2017-06-14 02:00:00 Europe/Vienna
barcode_str_mv +YW19087904
callnumbers_txt_mv 22305-C
inventoryNumbers_str_mv BNW-22305-C
materialTypes_str_mv BOOK
permanentLibraries_str_mv YWOAW
permanentLocations_str_mv MAG1-3
inventoryDates_str_mv 19991230
createdDates_str_mv 2017-06-14 02:00:00 Europe/Vienna
holdingIds_str_mv 2219803290004498
hierarchy_parent_id AC04914138
hierarchy_parent_title TRITA : NA 9104
hierarchy_sequence 9104
is_hierarchy_id AC01974239
is_hierarchy_title Algorithms and minimal forbidden minors for tree-decomposable graphs
container_title TRITA : NA 9104
container_reference AC04914138
_version_ 1796648930257141760

Similar Items