Verfügbarkeit: Algorithmic graph theory and perfect graphs

Algorithmic graph theory and perfect graphs:

Gespeichert in:

Bibliographische Detailangaben
Beteilige Person:	Golumbic, Martin Charles 1948- (VerfasserIn)
Format:	Buch
Sprache:	Englisch
Veröffentlicht:	New York, NY [u.a.] Academic Press 1980
Ausgabe:	1. printing
Schriftenreihe:	Computer Science and Applied Mathematics
Schlagwörter:	Grafentheorie Graphes parfaits Graphes, Théorie des algorithme graphe permutation theorie graphe Perfect graphs Graphentheorie Graph Komplexitätstheorie
Umfang:	XX, 284 Seiten graph. Darst.
ISBN:	0122892607

Internformat

MARC


LEADER	00000nam a2200000zc 4500
001	BV021943222
003	DE-604
005	20210315
007	t\|
008	981118s1980 xx d\|\|\| \|\|\|\| 00\|\|\| eng d
020			\|a 0122892607 \|9 0-12-289260-7
035			\|a (OCoLC)5564855
035			\|a (DE-599)BVBBV021943222
040			\|a DE-604 \|b ger
041	0		\|a eng
049			\|a DE-706 \|a DE-188
050		0	\|a QA166
082	0		\|a 511/.5 \|2 19
084			\|a SK 170 \|0 (DE-625)143221: \|2 rvk
084			\|a SK 890 \|0 (DE-625)143267: \|2 rvk
084			\|a QH 400 \|0 (DE-625)141571: \|2 rvk
100	1		\|a Golumbic, Martin Charles \|d 1948- \|e Verfasser \|0 (DE-588)1089493622 \|4 aut
245	1	0	\|a Algorithmic graph theory and perfect graphs \|c Martin Charles Golumbic, Courant Institute of Mathematical Sciences, New York University, New York, New York
250			\|a 1. printing
264		1	\|a New York, NY [u.a.] \|b Academic Press \|c 1980
300			\|a XX, 284 Seiten \|b graph. Darst.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
490	0		\|a Computer Science and Applied Mathematics
650		7	\|a Grafentheorie \|2 gtt
650		7	\|a Graphes parfaits \|2 ram
650		4	\|a Graphes, Théorie des
650		7	\|a algorithme \|2 inriac
650		7	\|a graphe permutation \|2 inriac
650		7	\|a theorie graphe \|2 inriac
650		4	\|a Perfect graphs
650	0	7	\|a Graphentheorie \|0 (DE-588)4113782-6 \|2 gnd \|9 rswk-swf
650	0	7	\|a Graph \|0 (DE-588)4021842-9 \|2 gnd \|9 rswk-swf
650	0	7	\|a Komplexitätstheorie \|0 (DE-588)4120591-1 \|2 gnd \|9 rswk-swf
689	0	0	\|a Graph \|0 (DE-588)4021842-9 \|D s
689	0		\|5 DE-604
689	1	0	\|a Graphentheorie \|0 (DE-588)4113782-6 \|D s
689	1	1	\|a Komplexitätstheorie \|0 (DE-588)4120591-1 \|D s
689	1		\|8 1\p \|5 DE-604
883	1		\|8 1\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
943	1		\|a oai:aleph.bib-bvb.de:BVB01-015158372

Datensatz im Suchindex

_version_	1818963450721730560
any_adam_object
author	Golumbic, Martin Charles 1948-
author_GND	(DE-588)1089493622
author_facet	Golumbic, Martin Charles 1948-
author_role	aut
author_sort	Golumbic, Martin Charles 1948-
author_variant	m c g mc mcg
building	Verbundindex
bvnumber	BV021943222
callnumber-first	Q - Science
callnumber-label	QA166
callnumber-raw	QA166
callnumber-search	QA166
callnumber-sort	QA 3166
callnumber-subject	QA - Mathematics
classification_rvk	SK 170 SK 890 QH 400
ctrlnum	(OCoLC)5564855 (DE-599)BVBBV021943222
dewey-full	511/.5
dewey-hundreds	500 - Natural sciences and mathematics
dewey-ones	511 - General principles of mathematics
dewey-raw	511/.5
dewey-search	511/.5
dewey-sort	3511 15
dewey-tens	510 - Mathematics
discipline	Mathematik Wirtschaftswissenschaften
edition	1. printing
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01872nam a2200529zc 4500</leader><controlfield tag="001">BV021943222</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210315 </controlfield><controlfield tag="007">t\|</controlfield><controlfield tag="008">981118s1980 xx d\|\|\| \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0122892607</subfield><subfield code="9">0-12-289260-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)5564855</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021943222</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA166</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.5</subfield><subfield code="2">19</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 170</subfield><subfield code="0">(DE-625)143221:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 400</subfield><subfield code="0">(DE-625)141571:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Golumbic, Martin Charles</subfield><subfield code="d">1948-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1089493622</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithmic graph theory and perfect graphs</subfield><subfield code="c">Martin Charles Golumbic, Courant Institute of Mathematical Sciences, New York University, New York, New York</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. printing</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York, NY [u.a.]</subfield><subfield code="b">Academic Press</subfield><subfield code="c">1980</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XX, 284 Seiten</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="490" ind1="0" ind2=" "><subfield code="a">Computer Science and Applied Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Grafentheorie</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Graphes parfaits</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graphes, Théorie des</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">graphe permutation</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">theorie graphe</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Perfect graphs</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">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</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">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015158372</subfield></datafield></record></collection>
id	DE-604.BV021943222
illustrated	Illustrated
indexdate	2024-12-20T12:45:25Z
institution	BVB
isbn	0122892607
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-015158372
oclc_num	5564855
open_access_boolean
owner	DE-706 DE-188
owner_facet	DE-706 DE-188
physical	XX, 284 Seiten graph. Darst.
publishDate	1980
publishDateSearch	1980
publishDateSort	1980
publisher	Academic Press
record_format	marc
series2	Computer Science and Applied Mathematics
spelling	Golumbic, Martin Charles 1948- Verfasser (DE-588)1089493622 aut Algorithmic graph theory and perfect graphs Martin Charles Golumbic, Courant Institute of Mathematical Sciences, New York University, New York, New York 1. printing New York, NY [u.a.] Academic Press 1980 XX, 284 Seiten graph. Darst. txt rdacontent n rdamedia nc rdacarrier Computer Science and Applied Mathematics Grafentheorie gtt Graphes parfaits ram Graphes, Théorie des algorithme inriac graphe permutation inriac theorie graphe inriac Perfect graphs Graphentheorie (DE-588)4113782-6 gnd rswk-swf Graph (DE-588)4021842-9 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Graph (DE-588)4021842-9 s DE-604 Graphentheorie (DE-588)4113782-6 s Komplexitätstheorie (DE-588)4120591-1 s 1\p DE-604 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk
spellingShingle	Golumbic, Martin Charles 1948- Algorithmic graph theory and perfect graphs Grafentheorie gtt Graphes parfaits ram Graphes, Théorie des algorithme inriac graphe permutation inriac theorie graphe inriac Perfect graphs Graphentheorie (DE-588)4113782-6 gnd Graph (DE-588)4021842-9 gnd Komplexitätstheorie (DE-588)4120591-1 gnd
subject_GND	(DE-588)4113782-6 (DE-588)4021842-9 (DE-588)4120591-1
title	Algorithmic graph theory and perfect graphs
title_auth	Algorithmic graph theory and perfect graphs
title_exact_search	Algorithmic graph theory and perfect graphs
title_full	Algorithmic graph theory and perfect graphs Martin Charles Golumbic, Courant Institute of Mathematical Sciences, New York University, New York, New York
title_fullStr	Algorithmic graph theory and perfect graphs Martin Charles Golumbic, Courant Institute of Mathematical Sciences, New York University, New York, New York
title_full_unstemmed	Algorithmic graph theory and perfect graphs Martin Charles Golumbic, Courant Institute of Mathematical Sciences, New York University, New York, New York
title_short	Algorithmic graph theory and perfect graphs
title_sort	algorithmic graph theory and perfect graphs
topic	Grafentheorie gtt Graphes parfaits ram Graphes, Théorie des algorithme inriac graphe permutation inriac theorie graphe inriac Perfect graphs Graphentheorie (DE-588)4113782-6 gnd Graph (DE-588)4021842-9 gnd Komplexitätstheorie (DE-588)4120591-1 gnd
topic_facet	Grafentheorie Graphes parfaits Graphes, Théorie des algorithme graphe permutation theorie graphe Perfect graphs Graphentheorie Graph Komplexitätstheorie
work_keys_str_mv	AT golumbicmartincharles algorithmicgraphtheoryandperfectgraphs

Verfügbarkeit

MARC

Datensatz im Suchindex

‌