Verfügbarkeit: Matching minors in bipartite graphs

Matching minors in bipartite graphs:

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	Wiederrecht, Sebastian (VerfasserIn)
Format:	Abschlussarbeit Elektronisch E-Book
Sprache:	English
Veröffentlicht:	Berlin Universitätsverlag der TU Berlin 2022
Schriftenreihe:	Foundations of computing volume 16
Schlagworte:	Matching > Graphentheorie Bipartiter Graph Minor > Graphentheorie matching minor structural graph theory bipartite perfect matching Matching Minor strukturelle Graphentheorie Bipartit perfektes Matching Hochschulschrift
Online-Zugang:	Volltext Volltext
Beschreibung:	1 Online-Ressource (XVII, 463 Seiten) Illustrationen
ISBN:	9783798332539
DOI:	10.14279/depositonce-14958

Internformat

MARC


LEADER	00000nam a22000008cb4500
001	BV047959364
003	DE-604
005	20220810
007	cr\|uuu---uuuuu
008	220428s2022 gw a\|\|\| om\|\|\| 00\|\|\| eng d
015			\|a 22,N17 \|2 dnb
020			\|a 9783798332539 \|c Online \|9 978-3-7983-3253-9
024	7		\|a 10.14279/depositonce-14958 \|2 doi
035			\|a (OCoLC)1314902078
035			\|a (DE-599)BVBBV047959364
040			\|a DE-604 \|b ger \|e rda
041	0		\|a eng
044			\|a gw \|c XA-DE-BE
049			\|a DE-12 \|a DE-210 \|a DE-521 \|a DE-1102 \|a DE-1046 \|a DE-1028 \|a DE-1050 \|a DE-573 \|a DE-M347 \|a DE-92 \|a DE-1051 \|a DE-898 \|a DE-859 \|a DE-860 \|a DE-1049 \|a DE-861 \|a DE-863 \|a DE-862 \|a DE-Re13 \|a DE-Y3 \|a DE-255 \|a DE-Y7 \|a DE-Y2 \|a DE-70 \|a DE-2174 \|a DE-127 \|a DE-22 \|a DE-155 \|a DE-83 \|a DE-91 \|a DE-384 \|a DE-473 \|a DE-19 \|a DE-355 \|a DE-703 \|a DE-20 \|a DE-706 \|a DE-824 \|a DE-29 \|a DE-739
084			\|a ST 620 \|0 (DE-625)143684: \|2 rvk
100	1		\|a Wiederrecht, Sebastian \|e Verfasser \|0 (DE-588)1256376868 \|4 aut
245	1	0	\|a Matching minors in bipartite graphs \|c Sebastian Wiederrecht
264		1	\|a Berlin \|b Universitätsverlag der TU Berlin \|c 2022
300			\|a 1 Online-Ressource (XVII, 463 Seiten) \|b Illustrationen
336			\|b txt \|2 rdacontent
337			\|b c \|2 rdamedia
338			\|b cr \|2 rdacarrier
490	1		\|a Foundations of computing \|v volume 16
502			\|b Dissertation \|c Technische Universität Berlin \|d 2021
650	0	7	\|a Matching \|g Graphentheorie \|0 (DE-588)4831446-8 \|2 gnd \|9 rswk-swf
650	0	7	\|a Bipartiter Graph \|0 (DE-588)4145661-0 \|2 gnd \|9 rswk-swf
650	0	7	\|a Minor \|g Graphentheorie \|0 (DE-588)4694399-7 \|2 gnd \|9 rswk-swf
653			\|a matching minor
653			\|a structural graph theory
653			\|a bipartite
653			\|a perfect matching
653			\|a Matching Minor
653			\|a strukturelle Graphentheorie
653			\|a Bipartit
653			\|a perfektes Matching
655		7	\|0 (DE-588)4113937-9 \|a Hochschulschrift \|2 gnd-content
689	0	0	\|a Bipartiter Graph \|0 (DE-588)4145661-0 \|D s
689	0	1	\|a Minor \|g Graphentheorie \|0 (DE-588)4694399-7 \|D s
689	0	2	\|a Matching \|g Graphentheorie \|0 (DE-588)4831446-8 \|D s
689	0		\|5 DE-604
710	2		\|a Technische Universität Berlin \|b Universitätsbibliothek \|0 (DE-588)5053182-7 \|4 pbl
776	0	8	\|i Erscheint auch als \|n Druck-Ausgabe \|z 978-3-7983-3252-2
830		0	\|a Foundations of computing \|v volume 16 \|w (DE-604)BV044943050 \|9 16
856	4	0	\|u https://directory.doabooks.org/handle/20.500.12854/87653 \|x Verlag \|z kostenfrei \|3 Volltext
856	4	0	\|u https://doi.org/10.14279/depositonce-14958 \|x Resolving-System \|z kostenfrei \|3 Volltext
912			\|a ZDB-94-OAB
943	1		\|a oai:aleph.bib-bvb.de:BVB01-033340596

Datensatz im Suchindex

_version_	1822082575541207040
adam_text
adam_txt
any_adam_object
any_adam_object_boolean
author	Wiederrecht, Sebastian
author_GND	(DE-588)1256376868
author_facet	Wiederrecht, Sebastian
author_role	aut
author_sort	Wiederrecht, Sebastian
author_variant	s w sw
building	Verbundindex
bvnumber	BV047959364
classification_rvk	ST 620
collection	ZDB-94-OAB
ctrlnum	(OCoLC)1314902078 (DE-599)BVBBV047959364
discipline	Informatik
discipline_str_mv	Informatik
doi_str_mv	10.14279/depositonce-14958
format	Thesis Electronic eBook
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a22000008cb4500</leader><controlfield tag="001">BV047959364</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220810</controlfield><controlfield tag="007">cr\|uuu---uuuuu</controlfield><controlfield tag="008">220428s2022 gw a\|\|\| om\|\|\| 00\|\|\| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">22,N17</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783798332539</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-7983-3253-9</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.14279/depositonce-14958</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1314902078</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047959364</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE-BE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-210</subfield><subfield code="a">DE-521</subfield><subfield code="a">DE-1102</subfield><subfield code="a">DE-1046</subfield><subfield code="a">DE-1028</subfield><subfield code="a">DE-1050</subfield><subfield code="a">DE-573</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-1051</subfield><subfield code="a">DE-898</subfield><subfield code="a">DE-859</subfield><subfield code="a">DE-860</subfield><subfield code="a">DE-1049</subfield><subfield code="a">DE-861</subfield><subfield code="a">DE-863</subfield><subfield code="a">DE-862</subfield><subfield code="a">DE-Re13</subfield><subfield code="a">DE-Y3</subfield><subfield code="a">DE-255</subfield><subfield code="a">DE-Y7</subfield><subfield code="a">DE-Y2</subfield><subfield code="a">DE-70</subfield><subfield code="a">DE-2174</subfield><subfield code="a">DE-127</subfield><subfield code="a">DE-22</subfield><subfield code="a">DE-155</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-739</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 620</subfield><subfield code="0">(DE-625)143684:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Wiederrecht, Sebastian</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1256376868</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Matching minors in bipartite graphs</subfield><subfield code="c">Sebastian Wiederrecht</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="b">Universitätsverlag der TU Berlin</subfield><subfield code="c">2022</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XVII, 463 Seiten)</subfield><subfield code="b">Illustrationen</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Foundations of computing</subfield><subfield code="v">volume 16</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="b">Dissertation</subfield><subfield code="c">Technische Universität Berlin</subfield><subfield code="d">2021</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Matching</subfield><subfield code="g">Graphentheorie</subfield><subfield code="0">(DE-588)4831446-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Bipartiter Graph</subfield><subfield code="0">(DE-588)4145661-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Minor</subfield><subfield code="g">Graphentheorie</subfield><subfield code="0">(DE-588)4694399-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">matching minor</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">structural graph theory</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">bipartite</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">perfect matching</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Matching Minor</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">strukturelle Graphentheorie</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Bipartit</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">perfektes Matching</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Bipartiter Graph</subfield><subfield code="0">(DE-588)4145661-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Minor</subfield><subfield code="g">Graphentheorie</subfield><subfield code="0">(DE-588)4694399-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Matching</subfield><subfield code="g">Graphentheorie</subfield><subfield code="0">(DE-588)4831446-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="710" ind1="2" ind2=" "><subfield code="a">Technische Universität Berlin</subfield><subfield code="b">Universitätsbibliothek</subfield><subfield code="0">(DE-588)5053182-7</subfield><subfield code="4">pbl</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">978-3-7983-3252-2</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Foundations of computing</subfield><subfield code="v">volume 16</subfield><subfield code="w">(DE-604)BV044943050</subfield><subfield code="9">16</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://directory.doabooks.org/handle/20.500.12854/87653</subfield><subfield code="x">Verlag</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.14279/depositonce-14958</subfield><subfield code="x">Resolving-System</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-94-OAB</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-033340596</subfield></datafield></record></collection>
genre	(DE-588)4113937-9 Hochschulschrift gnd-content
genre_facet	Hochschulschrift
id	DE-604.BV047959364
illustrated	Illustrated
index_date	2024-07-03T19:40:00Z
indexdate	2025-01-23T23:02:34Z
institution	BVB
institution_GND	(DE-588)5053182-7
isbn	9783798332539
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-033340596
oclc_num	1314902078
open_access_boolean	1
owner	DE-12 DE-210 DE-521 DE-1102 DE-1046 DE-1028 DE-1050 DE-573 DE-M347 DE-92 DE-1051 DE-898 DE-BY-UBR DE-859 DE-860 DE-1049 DE-861 DE-863 DE-BY-FWS DE-862 DE-BY-FWS DE-Re13 DE-BY-UBR DE-Y3 DE-255 DE-Y7 DE-Y2 DE-70 DE-2174 DE-127 DE-22 DE-BY-UBG DE-155 DE-BY-UBR DE-83 DE-91 DE-BY-TUM DE-384 DE-473 DE-BY-UBG DE-19 DE-BY-UBM DE-355 DE-BY-UBR DE-703 DE-20 DE-706 DE-824 DE-29 DE-739
owner_facet	DE-12 DE-210 DE-521 DE-1102 DE-1046 DE-1028 DE-1050 DE-573 DE-M347 DE-92 DE-1051 DE-898 DE-BY-UBR DE-859 DE-860 DE-1049 DE-861 DE-863 DE-BY-FWS DE-862 DE-BY-FWS DE-Re13 DE-BY-UBR DE-Y3 DE-255 DE-Y7 DE-Y2 DE-70 DE-2174 DE-127 DE-22 DE-BY-UBG DE-155 DE-BY-UBR DE-83 DE-91 DE-BY-TUM DE-384 DE-473 DE-BY-UBG DE-19 DE-BY-UBM DE-355 DE-BY-UBR DE-703 DE-20 DE-706 DE-824 DE-29 DE-739
physical	1 Online-Ressource (XVII, 463 Seiten) Illustrationen
psigel	ZDB-94-OAB
publishDate	2022
publishDateSearch	2022
publishDateSort	2022
publisher	Universitätsverlag der TU Berlin
record_format	marc
series	Foundations of computing
series2	Foundations of computing
spelling	Wiederrecht, Sebastian Verfasser (DE-588)1256376868 aut Matching minors in bipartite graphs Sebastian Wiederrecht Berlin Universitätsverlag der TU Berlin 2022 1 Online-Ressource (XVII, 463 Seiten) Illustrationen txt rdacontent c rdamedia cr rdacarrier Foundations of computing volume 16 Dissertation Technische Universität Berlin 2021 Matching Graphentheorie (DE-588)4831446-8 gnd rswk-swf Bipartiter Graph (DE-588)4145661-0 gnd rswk-swf Minor Graphentheorie (DE-588)4694399-7 gnd rswk-swf matching minor structural graph theory bipartite perfect matching Matching Minor strukturelle Graphentheorie Bipartit perfektes Matching (DE-588)4113937-9 Hochschulschrift gnd-content Bipartiter Graph (DE-588)4145661-0 s Minor Graphentheorie (DE-588)4694399-7 s Matching Graphentheorie (DE-588)4831446-8 s DE-604 Technische Universität Berlin Universitätsbibliothek (DE-588)5053182-7 pbl Erscheint auch als Druck-Ausgabe 978-3-7983-3252-2 Foundations of computing volume 16 (DE-604)BV044943050 16 https://directory.doabooks.org/handle/20.500.12854/87653 Verlag kostenfrei Volltext https://doi.org/10.14279/depositonce-14958 Resolving-System kostenfrei Volltext
spellingShingle	Wiederrecht, Sebastian Matching minors in bipartite graphs Foundations of computing Matching Graphentheorie (DE-588)4831446-8 gnd Bipartiter Graph (DE-588)4145661-0 gnd Minor Graphentheorie (DE-588)4694399-7 gnd
subject_GND	(DE-588)4831446-8 (DE-588)4145661-0 (DE-588)4694399-7 (DE-588)4113937-9
title	Matching minors in bipartite graphs
title_auth	Matching minors in bipartite graphs
title_exact_search	Matching minors in bipartite graphs
title_exact_search_txtP	Matching minors in bipartite graphs
title_full	Matching minors in bipartite graphs Sebastian Wiederrecht
title_fullStr	Matching minors in bipartite graphs Sebastian Wiederrecht
title_full_unstemmed	Matching minors in bipartite graphs Sebastian Wiederrecht
title_short	Matching minors in bipartite graphs
title_sort	matching minors in bipartite graphs
topic	Matching Graphentheorie (DE-588)4831446-8 gnd Bipartiter Graph (DE-588)4145661-0 gnd Minor Graphentheorie (DE-588)4694399-7 gnd
topic_facet	Matching Graphentheorie Bipartiter Graph Minor Graphentheorie Hochschulschrift
url	https://directory.doabooks.org/handle/20.500.12854/87653 https://doi.org/10.14279/depositonce-14958
volume_link	(DE-604)BV044943050
work_keys_str_mv	AT wiederrechtsebastian matchingminorsinbipartitegraphs AT technischeuniversitatberlinuniversitatsbibliothek matchingminorsinbipartitegraphs

Verfügbarkeit

Volltext öffnen

MARC

Datensatz im Suchindex

Ähnliche Einträge