Verfügbarkeit: An improvement of an algorithm for construction of edge disjoint branchings

An improvement of an algorithm for construction of edge disjoint branchings:

Gespeichert in:

Bibliographische Detailangaben
Beteilige Person:	Moran, Shlomo (VerfasserIn)
Format:	Buch
Sprache:	Nichtbestimmte Sprache
Veröffentlicht:	Haifa, Israel 1984
Schriftenreihe:	haṭ- Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā> / Department of Computer Science: Technical report 341
Umfang:	5 Bl.

Internformat

MARC


LEADER	00000nam a2200000 cb4500
001	BV010503501
003	DE-604
005	00000000000000.0
007	t\|
008	951201s1984 xx \|\|\|\| 00\|\|\| undod
035			\|a (OCoLC)1069171194
035			\|a (DE-599)BVBBV010503501
040			\|a DE-604 \|b ger \|e rakddb
041			\|a und
049			\|a DE-91G
100	1		\|a Moran, Shlomo \|e Verfasser \|4 aut
245	1	0	\|a An improvement of an algorithm for construction of edge disjoint branchings \|c by S. Moran
264		1	\|a Haifa, Israel \|c 1984
300			\|a 5 Bl.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
490	1		\|a haṭ- Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā> / Department of Computer Science: Technical report \|v 341
810	2		\|a Department of Computer Science: Technical report \|t <<haṭ->> Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā> \|v 341 \|w (DE-604)BV010499135 \|9 341
943	1		\|a oai:aleph.bib-bvb.de:BVB01-006999948

Datensatz im Suchindex

DE-BY-TUM_call_number	0111 2001 B 6045-341
DE-BY-TUM_katkey	665881
DE-BY-TUM_location	01
DE-BY-TUM_media_number	040010103456
_version_	1821930962690244608
any_adam_object
author	Moran, Shlomo
author_facet	Moran, Shlomo
author_role	aut
author_sort	Moran, Shlomo
author_variant	s m sm
building	Verbundindex
bvnumber	BV010503501
ctrlnum	(OCoLC)1069171194 (DE-599)BVBBV010503501
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01004nam a2200265 cb4500</leader><controlfield tag="001">BV010503501</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t\|</controlfield><controlfield tag="008">951201s1984 xx \|\|\|\| 00\|\|\| undod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1069171194</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010503501</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-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Moran, Shlomo</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An improvement of an algorithm for construction of edge disjoint branchings</subfield><subfield code="c">by S. Moran</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Haifa, Israel</subfield><subfield code="c">1984</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">5 Bl.</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">haṭ- Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā> / Department of Computer Science: Technical report</subfield><subfield code="v">341</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t"><<haṭ->> Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā></subfield><subfield code="v">341</subfield><subfield code="w">(DE-604)BV010499135</subfield><subfield code="9">341</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006999948</subfield></datafield></record></collection>
id	DE-604.BV010503501
illustrated	Not Illustrated
indexdate	2024-12-20T09:55:19Z
institution	BVB
language	Undetermined
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-006999948
oclc_num	1069171194
open_access_boolean
owner	DE-91G DE-BY-TUM
owner_facet	DE-91G DE-BY-TUM
physical	5 Bl.
publishDate	1984
publishDateSearch	1984
publishDateSort	1984
record_format	marc
series2	haṭ- Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā> / Department of Computer Science: Technical report
spellingShingle	Moran, Shlomo An improvement of an algorithm for construction of edge disjoint branchings
title	An improvement of an algorithm for construction of edge disjoint branchings
title_auth	An improvement of an algorithm for construction of edge disjoint branchings
title_exact_search	An improvement of an algorithm for construction of edge disjoint branchings
title_full	An improvement of an algorithm for construction of edge disjoint branchings by S. Moran
title_fullStr	An improvement of an algorithm for construction of edge disjoint branchings by S. Moran
title_full_unstemmed	An improvement of an algorithm for construction of edge disjoint branchings by S. Moran
title_short	An improvement of an algorithm for construction of edge disjoint branchings
title_sort	an improvement of an algorithm for construction of edge disjoint branchings
volume_link	(DE-604)BV010499135
work_keys_str_mv	AT moranshlomo animprovementofanalgorithmforconstructionofedgedisjointbranchings

Verfügbarkeit

Bestellen (Login erforderlich)

Paper/Kapitel scannen lassen

Teilbibliothek Mathematik & Informatik, Berichte

Bestandsangaben von Teilbibliothek Mathematik & Informatik, Berichte
Signatur:	0111 2001 B 6045-341 Lageplan
Exemplar 1	Ausleihbar Am Standort