Availability: Minimum spanning trees in bipartite graphs

Saved in:

Bibliographic Details
Main Authors:	Hefner, Andreas (Author), Kleinschmidt, Peter (Author)
Format:	Book
Language:	Undetermined
Published:	Passau 1992
Series:	Universität <Passau> 1992,7
Physical Description:	4 S.

Staff View

MARC


LEADER	00000nam a2200000 cb4500
001	BV006608977
003	DE-604
005	19940628
007	t\|
008	930210s1992 xx \|\|\|\| 00\|\|\| und d
035			\|a (OCoLC)246712128
035			\|a (DE-599)BVBBV006608977
040			\|a DE-604 \|b ger \|e rakddb
041			\|a und
049			\|a DE-154 \|a DE-739 \|a DE-29T \|a DE-12 \|a DE-384 \|a DE-91G
100	1		\|a Hefner, Andreas \|e Verfasser \|4 aut
245	1	0	\|a Minimum spanning trees in bipartite graphs \|c Andreas Hefner ; Peter Kleinschmidt
264		1	\|a Passau \|c 1992
300			\|a 4 S.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
490	1		\|a Universität <Passau> / Fakultät für Mathematik und Informatik: MIP \|v 1992,7
700	1		\|a Kleinschmidt, Peter \|e Verfasser \|4 aut
810	2		\|a Fakultät für Mathematik und Informatik: MIP \|t Universität <Passau> \|v 1992,7 \|w (DE-604)BV000905393 \|9 1992,7
943	1		\|a oai:aleph.bib-bvb.de:BVB01-004222226

Record in the Search Index

DE-BY-TUM_call_number	0111 2001 B 6104-1992,7
DE-BY-TUM_katkey	754230
DE-BY-TUM_location	01
DE-BY-TUM_media_number	040010271653
_version_	1821935767499309056
adam_text
any_adam_object
author	Hefner, Andreas Kleinschmidt, Peter
author_facet	Hefner, Andreas Kleinschmidt, Peter
author_role	aut aut
author_sort	Hefner, Andreas
author_variant	a h ah p k pk
building	Verbundindex
bvnumber	BV006608977
classification_rvk	SS 5600
ctrlnum	(OCoLC)246712128 (DE-599)BVBBV006608977
discipline	Informatik
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV006608977</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19940628</controlfield><controlfield tag="007">t\|</controlfield><controlfield tag="008">930210s1992 xx \|\|\|\| 00\|\|\| und d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)246712128</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV006608977</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-154</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hefner, Andreas</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Minimum spanning trees in bipartite graphs</subfield><subfield code="c">Andreas Hefner ; Peter Kleinschmidt</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Passau</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">4 S.</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Universität <Passau> / Fakultät für Mathematik und Informatik: MIP</subfield><subfield code="v">1992,7</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kleinschmidt, Peter</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Fakultät für Mathematik und Informatik: MIP</subfield><subfield code="t">Universität <Passau></subfield><subfield code="v">1992,7</subfield><subfield code="w">(DE-604)BV000905393</subfield><subfield code="9">1992,7</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-004222226</subfield></datafield></record></collection>
id	DE-604.BV006608977
illustrated	Not Illustrated
indexdate	2025-01-11T19:13:25Z
institution	BVB
language	Undetermined
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-004222226
oclc_num	246712128
open_access_boolean
owner	DE-154 DE-739 DE-29T DE-12 DE-384 DE-91G DE-BY-TUM
owner_facet	DE-154 DE-739 DE-29T DE-12 DE-384 DE-91G DE-BY-TUM
physical	4 S.
publishDate	1992
publishDateSearch	1992
publishDateSort	1992
record_format	marc
series2	Universität <Passau> / Fakultät für Mathematik und Informatik: MIP
spellingShingle	Hefner, Andreas Kleinschmidt, Peter Minimum spanning trees in bipartite graphs
title	Minimum spanning trees in bipartite graphs
title_auth	Minimum spanning trees in bipartite graphs
title_exact_search	Minimum spanning trees in bipartite graphs
title_full	Minimum spanning trees in bipartite graphs Andreas Hefner ; Peter Kleinschmidt
title_fullStr	Minimum spanning trees in bipartite graphs Andreas Hefner ; Peter Kleinschmidt
title_full_unstemmed	Minimum spanning trees in bipartite graphs Andreas Hefner ; Peter Kleinschmidt
title_short	Minimum spanning trees in bipartite graphs
title_sort	minimum spanning trees in bipartite graphs
volume_link	(DE-604)BV000905393
work_keys_str_mv	AT hefnerandreas minimumspanningtreesinbipartitegraphs AT kleinschmidtpeter minimumspanningtreesinbipartitegraphs

Availability

Order (Login required)

Order paper/chapter scan

Branch Library Mathematics & Informatics, Reports

Holdings details from Teilbibliothek Mathematik & Informatik, Berichte
Call Number:	0111 2001 B 6104-1992,7
Copy 1	Available for loan On Shelf