Availability: Ein Branch and Bound-Verfahren zur Lösung des Maximum-Clique-Problems

Ein Branch and Bound-Verfahren zur Lösung des Maximum-Clique-Problems:

Saved in:

Bibliographic Details
Main Author:	Babel, Luitpold 1962- (Author)
Format:	Thesis/Dissertation Book
Language:	German
Published:	1990
Subjects:	Graphentheorie Maximum-Clique-Problem Hochschulschrift
Physical Description:	114 S. graph. Darst.

Staff View

MARC


LEADER	00000nam a2200000 c 4500
001	BV004310908
003	DE-604
005	20200805
007	t\|
008	910408s1990 xx d\|\|\| m\|\|\| 00\|\|\| gerod
035			\|a (OCoLC)165581279
035			\|a (DE-599)BVBBV004310908
040			\|a DE-604 \|b ger \|e rakddb
041	0		\|a ger
049			\|a DE-91 \|a DE-91G \|a DE-12 \|a DE-384 \|a DE-703 \|a DE-355 \|a DE-824 \|a DE-29T \|a DE-154 \|a DE-19 \|a DE-706 \|a DE-11 \|a DE-188
084			\|a MAT 055d \|2 stub
100	1		\|a Babel, Luitpold \|d 1962- \|e Verfasser \|0 (DE-588)1215213646 \|4 aut
245	1	0	\|a Ein Branch and Bound-Verfahren zur Lösung des Maximum-Clique-Problems \|c Luitpold Babel
264		1	\|c 1990
300			\|a 114 S. \|b graph. Darst.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
502			\|a München, Techn. Univ., Diss., 1990
650	0	7	\|a Graphentheorie \|0 (DE-588)4113782-6 \|2 gnd \|9 rswk-swf
650	0	7	\|a Maximum-Clique-Problem \|0 (DE-588)4277664-8 \|2 gnd \|9 rswk-swf
655		7	\|0 (DE-588)4113937-9 \|a Hochschulschrift \|2 gnd-content
689	0	0	\|a Maximum-Clique-Problem \|0 (DE-588)4277664-8 \|D s
689	0		\|5 DE-604
689	1	0	\|a Maximum-Clique-Problem \|0 (DE-588)4277664-8 \|D s
689	1	1	\|a Graphentheorie \|0 (DE-588)4113782-6 \|D s
689	1		\|5 DE-604
943	1		\|a oai:aleph.bib-bvb.de:BVB01-002680588

Record in the Search Index

DE-BY-TUM_call_number	0001 DM 13721 0109 1.90 B 0639
DE-BY-TUM_katkey	517769
DE-BY-TUM_location	Mag 01
DE-BY-TUM_media_number	TEMP1935810 040020532967
_version_	1821937675905531904
any_adam_object
author	Babel, Luitpold 1962-
author_GND	(DE-588)1215213646
author_facet	Babel, Luitpold 1962-
author_role	aut
author_sort	Babel, Luitpold 1962-
author_variant	l b lb
building	Verbundindex
bvnumber	BV004310908
classification_tum	MAT 055d
ctrlnum	(OCoLC)165581279 (DE-599)BVBBV004310908
discipline	Mathematik
format	Thesis Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01301nam a2200361 c 4500</leader><controlfield tag="001">BV004310908</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20200805 </controlfield><controlfield tag="007">t\|</controlfield><controlfield tag="008">910408s1990 xx d\|\|\| m\|\|\| 00\|\|\| gerod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)165581279</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV004310908</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="0" ind2=" "><subfield code="a">ger</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-154</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 055d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Babel, Luitpold</subfield><subfield code="d">1962-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1215213646</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Ein Branch and Bound-Verfahren zur Lösung des Maximum-Clique-Problems</subfield><subfield code="c">Luitpold Babel</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">114 S.</subfield><subfield code="b">graph. Darst.</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="502" ind1=" " ind2=" "><subfield code="a">München, Techn. Univ., Diss., 1990</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Maximum-Clique-Problem</subfield><subfield code="0">(DE-588)4277664-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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">Maximum-Clique-Problem</subfield><subfield code="0">(DE-588)4277664-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Maximum-Clique-Problem</subfield><subfield code="0">(DE-588)4277664-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-002680588</subfield></datafield></record></collection>
genre	(DE-588)4113937-9 Hochschulschrift gnd-content
genre_facet	Hochschulschrift
id	DE-604.BV004310908
illustrated	Illustrated
indexdate	2024-12-20T08:16:23Z
institution	BVB
language	German
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-002680588
oclc_num	165581279
open_access_boolean
owner	DE-91 DE-BY-TUM DE-91G DE-BY-TUM DE-12 DE-384 DE-703 DE-355 DE-BY-UBR DE-824 DE-29T DE-154 DE-19 DE-BY-UBM DE-706 DE-11 DE-188
owner_facet	DE-91 DE-BY-TUM DE-91G DE-BY-TUM DE-12 DE-384 DE-703 DE-355 DE-BY-UBR DE-824 DE-29T DE-154 DE-19 DE-BY-UBM DE-706 DE-11 DE-188
physical	114 S. graph. Darst.
publishDate	1990
publishDateSearch	1990
publishDateSort	1990
record_format	marc
spellingShingle	Babel, Luitpold 1962- Ein Branch and Bound-Verfahren zur Lösung des Maximum-Clique-Problems Graphentheorie (DE-588)4113782-6 gnd Maximum-Clique-Problem (DE-588)4277664-8 gnd
subject_GND	(DE-588)4113782-6 (DE-588)4277664-8 (DE-588)4113937-9
title	Ein Branch and Bound-Verfahren zur Lösung des Maximum-Clique-Problems
title_auth	Ein Branch and Bound-Verfahren zur Lösung des Maximum-Clique-Problems
title_exact_search	Ein Branch and Bound-Verfahren zur Lösung des Maximum-Clique-Problems
title_full	Ein Branch and Bound-Verfahren zur Lösung des Maximum-Clique-Problems Luitpold Babel
title_fullStr	Ein Branch and Bound-Verfahren zur Lösung des Maximum-Clique-Problems Luitpold Babel
title_full_unstemmed	Ein Branch and Bound-Verfahren zur Lösung des Maximum-Clique-Problems Luitpold Babel
title_short	Ein Branch and Bound-Verfahren zur Lösung des Maximum-Clique-Problems
title_sort	ein branch and bound verfahren zur losung des maximum clique problems
topic	Graphentheorie (DE-588)4113782-6 gnd Maximum-Clique-Problem (DE-588)4277664-8 gnd
topic_facet	Graphentheorie Maximum-Clique-Problem Hochschulschrift
work_keys_str_mv	AT babelluitpold einbranchandboundverfahrenzurlosungdesmaximumcliqueproblems

Availability

Order (Login required)

Order paper/chapter scan

Closed Stacks

Holdings details from Bibliotheksmagazin
Call Number:	0001 DM 13721 Floor plan
Copy 1	Available for loan On Shelf

Branch Library Mathematics & Informatics, Dissertations and Theses

Holdings details from Teilbibliothek Mathematik & Informatik, Dissertationen und Abschlussarbeiten
Call Number:	0109 1.90 B 0639 Floor plan
Copy 1	Available for loan On Shelf