Verfügbarkeit: On sets and graphs

On sets and graphs: perspectives on logic and combinatorics

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Omodeo, Eugenio G. (VerfasserIn), Policriti, Alberto (VerfasserIn), Tomescu, Alexandru I. (VerfasserIn)
Format:	Elektronisch E-Book
Sprache:	English
Veröffentlicht:	Cham Springer [2017]
Schlagworte:	Computer science Algorithms Computer logic Combinatorics Graph theory Computer Science Logics and Meanings of Programs Algorithm Analysis and Problem Complexity Graph Theory Informatik
Online-Zugang:	BTU01 FHA01 FHI01 FHM01 FHN01 FHR01 FKE01 FLA01 FRO01 FWS01 FWS02 HTW01 UBG01 UBM01 UBR01 UBT01 UBW01 UBY01 UER01 UPA01 Volltext
Beschreibung:	1 Online-Ressource (XIX, 275 Seiten, 150 illus)
ISBN:	9783319549811
DOI:	10.1007/978-3-319-54981-1

Internformat

MARC


LEADER	00000nmm a2200000zc 4500
001	BV044335068
003	DE-604
005	20211227
007	cr\|uuu---uuuuu
008	170601s2017 \|\|\|\| o\|\|u\| \|\|\|\|\|\|eng d
020			\|a 9783319549811 \|c Online \|9 978-3-319-54981-1
024	7		\|a 10.1007/978-3-319-54981-1 \|2 doi
035			\|a (ZDB-2-SCS)9783319549811
035			\|a (OCoLC)989812707
035			\|a (DE-599)BVBBV044335068
040			\|a DE-604 \|b ger \|e rda
041	0		\|a eng
049			\|a DE-355 \|a DE-860 \|a DE-Aug4 \|a DE-898 \|a DE-861 \|a DE-523 \|a DE-859 \|a DE-473 \|a DE-29 \|a DE-863 \|a DE-20 \|a DE-862 \|a DE-92 \|a DE-573 \|a DE-M347 \|a DE-703 \|a DE-706 \|a DE-739 \|a DE-634 \|a DE-188 \|a DE-19
082	0		\|a 005.1015113 \|2 23
100	1		\|a Omodeo, Eugenio G. \|e Verfasser \|4 aut
245	1	0	\|a On sets and graphs \|b perspectives on logic and combinatorics \|c Eugenio G. Omodeo, Alberto Policriti, Alexandru I. Tomescu
264		1	\|a Cham \|b Springer \|c [2017]
300			\|a 1 Online-Ressource (XIX, 275 Seiten, 150 illus)
336			\|b txt \|2 rdacontent
337			\|b c \|2 rdamedia
338			\|b cr \|2 rdacarrier
650		4	\|a Computer science
650		4	\|a Algorithms
650		4	\|a Computer logic
650		4	\|a Combinatorics
650		4	\|a Graph theory
650		4	\|a Computer Science
650		4	\|a Logics and Meanings of Programs
650		4	\|a Algorithm Analysis and Problem Complexity
650		4	\|a Graph Theory
650		4	\|a Informatik
700	1		\|a Policriti, Alberto \|e Verfasser \|0 (DE-588)1058926845 \|4 aut
700	1		\|a Tomescu, Alexandru I. \|e Verfasser \|4 aut
776	0	8	\|i Erscheint auch als \|n Druck-Ausgabe \|z 978-3-319-54980-4
856	4	0	\|u https://doi.org/10.1007/978-3-319-54981-1 \|x Verlag \|z URL des Erstveröffentlichers \|3 Volltext
912			\|a ZDB-2-SCS
940	1		\|q ZDB-2-SCS_2017
999			\|a oai:aleph.bib-bvb.de:BVB01-029738247
966	e		\|u https://doi.org/10.1007/978-3-319-54981-1 \|l BTU01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-54981-1 \|l FHA01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-54981-1 \|l FHI01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-54981-1 \|l FHM01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-54981-1 \|l FHN01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-54981-1 \|l FHR01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-54981-1 \|l FKE01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-54981-1 \|l FLA01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-54981-1 \|l FRO01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-54981-1 \|l FWS01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-54981-1 \|l FWS02 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-54981-1 \|l HTW01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-54981-1 \|l UBG01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-54981-1 \|l UBM01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-54981-1 \|l UBR01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-54981-1 \|l UBT01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-54981-1 \|l UBW01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-54981-1 \|l UBY01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-54981-1 \|l UER01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-54981-1 \|l UPA01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext

Datensatz im Suchindex

DE-BY-FWS_katkey	649306
_version_	1806181339514273792
any_adam_object
author	Omodeo, Eugenio G. Policriti, Alberto Tomescu, Alexandru I.
author_GND	(DE-588)1058926845
author_facet	Omodeo, Eugenio G. Policriti, Alberto Tomescu, Alexandru I.
author_role	aut aut aut
author_sort	Omodeo, Eugenio G.
author_variant	e g o eg ego a p ap a i t ai ait
building	Verbundindex
bvnumber	BV044335068
collection	ZDB-2-SCS
ctrlnum	(ZDB-2-SCS)9783319549811 (OCoLC)989812707 (DE-599)BVBBV044335068
dewey-full	005.1015113
dewey-hundreds	000 - Computer science, information, general works
dewey-ones	005 - Computer programming, programs, data, security
dewey-raw	005.1015113
dewey-search	005.1015113
dewey-sort	15.1015113
dewey-tens	000 - Computer science, information, general works
discipline	Informatik
doi_str_mv	10.1007/978-3-319-54981-1
format	Electronic eBook
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03678nmm a2200721zc 4500</leader><controlfield tag="001">BV044335068</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20211227 </controlfield><controlfield tag="007">cr\|uuu---uuuuu</controlfield><controlfield tag="008">170601s2017 \|\|\|\| o\|\|u\| \|\|\|\|\|\|eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783319549811</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-319-54981-1</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-319-54981-1</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SCS)9783319549811</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)989812707</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV044335068</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="049" ind1=" " ind2=" "><subfield code="a">DE-355</subfield><subfield code="a">DE-860</subfield><subfield code="a">DE-Aug4</subfield><subfield code="a">DE-898</subfield><subfield code="a">DE-861</subfield><subfield code="a">DE-523</subfield><subfield code="a">DE-859</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-863</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-862</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-573</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-19</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1015113</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Omodeo, Eugenio G.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On sets and graphs</subfield><subfield code="b">perspectives on logic and combinatorics</subfield><subfield code="c">Eugenio G. Omodeo, Alberto Policriti, Alexandru I. Tomescu</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham</subfield><subfield code="b">Springer</subfield><subfield code="c">[2017]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XIX, 275 Seiten, 150 illus)</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="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer logic</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logics and Meanings of Programs</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithm Analysis and Problem Complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Policriti, Alberto</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1058926845</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tomescu, Alexandru I.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</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-319-54980-4</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-319-54981-1</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SCS</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SCS_2017</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029738247</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-54981-1</subfield><subfield code="l">BTU01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-54981-1</subfield><subfield code="l">FHA01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-54981-1</subfield><subfield code="l">FHI01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-54981-1</subfield><subfield code="l">FHM01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-54981-1</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-54981-1</subfield><subfield code="l">FHR01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-54981-1</subfield><subfield code="l">FKE01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-54981-1</subfield><subfield code="l">FLA01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-54981-1</subfield><subfield code="l">FRO01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-54981-1</subfield><subfield code="l">FWS01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-54981-1</subfield><subfield code="l">FWS02</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-54981-1</subfield><subfield code="l">HTW01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-54981-1</subfield><subfield code="l">UBG01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-54981-1</subfield><subfield code="l">UBM01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-54981-1</subfield><subfield code="l">UBR01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-54981-1</subfield><subfield code="l">UBT01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-54981-1</subfield><subfield code="l">UBW01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-54981-1</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-54981-1</subfield><subfield code="l">UER01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-54981-1</subfield><subfield code="l">UPA01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection>
id	DE-604.BV044335068
illustrated	Not Illustrated
indexdate	2024-08-01T12:39:14Z
institution	BVB
isbn	9783319549811
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-029738247
oclc_num	989812707
open_access_boolean
owner	DE-355 DE-BY-UBR DE-860 DE-Aug4 DE-898 DE-BY-UBR DE-861 DE-523 DE-859 DE-473 DE-BY-UBG DE-29 DE-863 DE-BY-FWS DE-20 DE-862 DE-BY-FWS DE-92 DE-573 DE-M347 DE-703 DE-706 DE-739 DE-634 DE-188 DE-19 DE-BY-UBM
owner_facet	DE-355 DE-BY-UBR DE-860 DE-Aug4 DE-898 DE-BY-UBR DE-861 DE-523 DE-859 DE-473 DE-BY-UBG DE-29 DE-863 DE-BY-FWS DE-20 DE-862 DE-BY-FWS DE-92 DE-573 DE-M347 DE-703 DE-706 DE-739 DE-634 DE-188 DE-19 DE-BY-UBM
physical	1 Online-Ressource (XIX, 275 Seiten, 150 illus)
psigel	ZDB-2-SCS ZDB-2-SCS_2017
publishDate	2017
publishDateSearch	2017
publishDateSort	2017
publisher	Springer
record_format	marc
spellingShingle	Omodeo, Eugenio G. Policriti, Alberto Tomescu, Alexandru I. On sets and graphs perspectives on logic and combinatorics Computer science Algorithms Computer logic Combinatorics Graph theory Computer Science Logics and Meanings of Programs Algorithm Analysis and Problem Complexity Graph Theory Informatik
title	On sets and graphs perspectives on logic and combinatorics
title_auth	On sets and graphs perspectives on logic and combinatorics
title_exact_search	On sets and graphs perspectives on logic and combinatorics
title_full	On sets and graphs perspectives on logic and combinatorics Eugenio G. Omodeo, Alberto Policriti, Alexandru I. Tomescu
title_fullStr	On sets and graphs perspectives on logic and combinatorics Eugenio G. Omodeo, Alberto Policriti, Alexandru I. Tomescu
title_full_unstemmed	On sets and graphs perspectives on logic and combinatorics Eugenio G. Omodeo, Alberto Policriti, Alexandru I. Tomescu
title_short	On sets and graphs
title_sort	on sets and graphs perspectives on logic and combinatorics
title_sub	perspectives on logic and combinatorics
topic	Computer science Algorithms Computer logic Combinatorics Graph theory Computer Science Logics and Meanings of Programs Algorithm Analysis and Problem Complexity Graph Theory Informatik
topic_facet	Computer science Algorithms Computer logic Combinatorics Graph theory Computer Science Logics and Meanings of Programs Algorithm Analysis and Problem Complexity Graph Theory Informatik
url	https://doi.org/10.1007/978-3-319-54981-1
work_keys_str_mv	AT omodeoeugeniog onsetsandgraphsperspectivesonlogicandcombinatorics AT policritialberto onsetsandgraphsperspectivesonlogicandcombinatorics AT tomescualexandrui onsetsandgraphsperspectivesonlogicandcombinatorics

Verfügbarkeit

Volltext öffnen

MARC

Datensatz im Suchindex

Ähnliche Einträge