Holdings: Distributed graph algorithms for computer networks

Distributed graph algorithms for computer networks:

Saved in:

Bibliographic Details
Main Author:	Erciyes, K. (Author)
Format:	Electronic eBook
Language:	English
Published:	London [u.a.] Springer 2013
Series:	Computer communications and networks
Subjects:	Rechnernetz Algorithmus Graphentheorie
Online Access:	BTU01 FHA01 FHM01 FHN01 FKE01 UBG01 UBR01 UBT01 UBW01 UER01 UPA01 Volltext Inhaltsverzeichnis Abstract
Physical Description:	1 Online-Ressource
ISBN:	9781447151722 9781447151739
DOI:	10.1007/978-1-4471-5173-9

Staff View

MARC


LEADER	00000nmm a2200000zc 4500
001	BV041071808
003	DE-604
005	00000000000000.0
007	cr\|uuu---uuuuu
008	130606s2013 \|\|\|\| o\|\|u\| \|\|\|\|\|\|eng d
015			\|a 13,O06 \|2 dnb
016	7		\|a 1034758853 \|2 DE-101
020			\|a 9781447151722 \|9 978-1-4471-5172-2
020			\|a 9781447151739 \|c Online \|9 978-1-4471-5173-9
024	7		\|a 10.1007/978-1-4471-5173-9 \|2 doi
024	3		\|a 9781447151739
035			\|a (OCoLC)852531969
035			\|a (DE-599)DNB1034758853
040			\|a DE-604 \|b ger \|e rakddb
041	0		\|a eng
049			\|a DE-473 \|a DE-M347 \|a DE-20 \|a DE-703 \|a DE-Aug4 \|a DE-92 \|a DE-29 \|a DE-859 \|a DE-634 \|a DE-739 \|a DE-355
082	0		\|a 005.1
084			\|a 004 \|2 sdnb
100	1		\|a Erciyes, K. \|e Verfasser \|4 aut
245	1	0	\|a Distributed graph algorithms for computer networks \|c K. Erciyes
264		1	\|a London [u.a.] \|b Springer \|c 2013
300			\|a 1 Online-Ressource
336			\|b txt \|2 rdacontent
337			\|b c \|2 rdamedia
338			\|b cr \|2 rdacarrier
490	0		\|a Computer communications and networks
650	0	7	\|a Rechnernetz \|0 (DE-588)4070085-9 \|2 gnd \|9 rswk-swf
650	0	7	\|a Algorithmus \|0 (DE-588)4001183-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a Graphentheorie \|0 (DE-588)4113782-6 \|2 gnd \|9 rswk-swf
689	0	0	\|a Rechnernetz \|0 (DE-588)4070085-9 \|D s
689	0	1	\|a Graphentheorie \|0 (DE-588)4113782-6 \|D s
689	0	2	\|a Algorithmus \|0 (DE-588)4001183-5 \|D s
689	0		\|8 1\p \|5 DE-604
856	4	0	\|u https://doi.org/10.1007/978-1-4471-5173-9 \|x Verlag \|3 Volltext
856	4	2	\|m Springer Fremddatenuebernahme \|q application/pdf \|u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=026048749&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
856	4	2	\|m Springer Fremddatenuebernahme \|q application/pdf \|u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=026048749&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA \|3 Abstract
912			\|a ZDB-2-SCS
999			\|a oai:aleph.bib-bvb.de:BVB01-026048749
883	1		\|8 1\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
966	e		\|u https://doi.org/10.1007/978-1-4471-5173-9 \|l BTU01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-1-4471-5173-9 \|l FHA01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-1-4471-5173-9 \|l FHM01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-1-4471-5173-9 \|l FHN01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-1-4471-5173-9 \|l FKE01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-1-4471-5173-9 \|l UBG01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-1-4471-5173-9 \|l UBR01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-1-4471-5173-9 \|l UBT01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-1-4471-5173-9 \|l UBW01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-1-4471-5173-9 \|l UER01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-1-4471-5173-9 \|l UPA01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext

Record in the Search Index

_version_	1804150438633668608
adam_text	DISTRIBUTED GRAPH ALGORITHMS FOR COMPUTER NETWORKS / ERCIYES, K. : 2013 TABLE OF CONTENTS / INHALTSVERZEICHNIS INTRODUCTION PART I: FUNDAMENTAL ALGORITHMS GRAPHS THE COMPUTATIONAL MODEL SPANNING TREE CONSTRUCTION GRAPH TRAVERSALS MINIMAL SPANNING TREES ROUTING SELF-STABILIZATION PART II: GRAPH THEORETICAL ALGORITHMS VERTEX COLORING MAXIMAL INDEPENDENT SETS DOMINATING SETS MATCHING VERTEX COVER PART III: AD HOC WIRELESS NETWORKS INTRODUCTION TOPOLOGY CONTROL AD HOC ROUTING SENSOR NETWORK APPLICATIONS ASSIST: A SIMULATOR TO DEVELOP DISTRIBUTED ALGORITHMS PSEUDOCODE CONVENTIONS ASSIST CODE APPLICATIONS USING ASSIST. DIESES SCHRIFTSTUECK WURDE MASCHINELL ERZEUGT. DISTRIBUTED GRAPH ALGORITHMS FOR COMPUTER NETWORKS / ERCIYES, K. : 2013 ABSTRACT / INHALTSTEXT GRAPH THEORY IS AN INVALUABLE TOOL FOR THE DESIGNER OF ALGORITHMS FOR DISTRIBUTED SYSTEMS. THIS HANDS-ON TEXTBOOK/REFERENCE PRESENTS A COMPREHENSIVE REVIEW OF KEY DISTRIBUTED GRAPH ALGORITHMS FOR COMPUTER NETWORK APPLICATIONS, WITH A PARTICULAR EMPHASIS ON PRACTICAL IMPLEMENTATION. EACH CHAPTER OPENS WITH A CONCISE INTRODUCTION TO A SPECIFIC PROBLEM, SUPPORTING THE THEORY WITH NUMEROUS EXAMPLES, BEFORE PROVIDING A LIST OF RELEVANT ALGORITHMS. THESE ALGORITHMS ARE DESCRIBED IN DETAIL FROM CONCEPTUAL BASIS TO PSEUDOCODE, COMPLETE WITH GRAPH TEMPLATES FOR THE STEPWISE IMPLEMENTATION OF THE ALGORITHM, FOLLOWED BY ITS ANALYSIS. THE CHAPTERS THEN CONCLUDE WITH SUMMARIZING NOTES AND PROGRAMMING EXERCISES. TOPICS AND FEATURES: INTRODUCES A RANGE OF FUNDAMENTAL GRAPH ALGORITHMS, COVERING SPANNING TREES, GRAPH TRAVERSAL ALGORITHMS, ROUTING ALGORITHMS, AND SELF-STABILIZATION REVIEWS GRAPH-THEORETICAL DISTRIBUTED APPROXIMATION ALGORITHMS WITH APPLICATIONS IN AD HOC WIRELESS NETWORKS DESCRIBES IN DETAIL THE IMPLEMENTATION OF EACH ALGORITHM, WITH EXTENSIVE USE OF SUPPORTING EXAMPLES, AND DISCUSSES THEIR CONCRETE NETWORK APPLICATIONS EXAMINES KEY GRAPH-THEORETICAL ALGORITHM CONCEPTS, SUCH AS DOMINATING SETS, AND PARAMETERS FOR MOBILITY AND ENERGY LEVELS OF NODES IN WIRELESS AD HOC NETWORKS, AND PROVIDES A CONTEMPORARY SURVEY OF EACH TOPIC PRESENTS A SIMPLE SIMULATOR, DEVELOPED TO RUN DISTRIBUTED ALGORITHMS PROVIDES PRACTICAL EXERCISES AT THE END OF EACH CHAPTER THIS CLASSROOM-TESTED AND EASY-TO-FOLLOW TEXTBOOK IS ESSENTIAL READING FOR ALL GRADUATE STUDENTS AND RESEARCHERS INTERESTED IN DISCRETE MATHEMATICS, ALGORITHMS AND COMPUTER NETWORKS. PROF. DR. KAYHAN ERCIYES IS THE RECTOR AND A MEMBER OF THE COMPUTER ENGINEERING DEPARTMENT AT IZMIR UNIVERSITY, TURKEY DIESES SCHRIFTSTUECK WURDE MASCHINELL ERZEUGT.
any_adam_object	1
author	Erciyes, K.
author_facet	Erciyes, K.
author_role	aut
author_sort	Erciyes, K.
author_variant	k e ke
building	Verbundindex
bvnumber	BV041071808
collection	ZDB-2-SCS
ctrlnum	(OCoLC)852531969 (DE-599)DNB1034758853
dewey-full	005.1
dewey-hundreds	000 - Computer science, information, general works
dewey-ones	005 - Computer programming, programs, data, security
dewey-raw	005.1
dewey-search	005.1
dewey-sort	15.1
dewey-tens	000 - Computer science, information, general works
discipline	Informatik
doi_str_mv	10.1007/978-1-4471-5173-9
format	Electronic eBook
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03196nmm a2200625zc 4500</leader><controlfield tag="001">BV041071808</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr\|uuu---uuuuu</controlfield><controlfield tag="008">130606s2013 \|\|\|\| o\|\|u\| \|\|\|\|\|\|eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">13,O06</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1034758853</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781447151722</subfield><subfield code="9">978-1-4471-5172-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781447151739</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-4471-5173-9</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4471-5173-9</subfield><subfield code="2">doi</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9781447151739</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)852531969</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1034758853</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">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-473</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-Aug4</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-859</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-355</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Erciyes, K.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Distributed graph algorithms for computer networks</subfield><subfield code="c">K. Erciyes</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">London [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2013</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource</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="490" ind1="0" ind2=" "><subfield code="a">Computer communications and networks</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Rechnernetz</subfield><subfield code="0">(DE-588)4070085-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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="689" ind1="0" ind2="0"><subfield code="a">Rechnernetz</subfield><subfield code="0">(DE-588)4070085-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" 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="0" ind2="2"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4471-5173-9</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Springer Fremddatenuebernahme</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=026048749&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Springer Fremddatenuebernahme</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=026048749&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Abstract</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SCS</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-026048749</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="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-4471-5173-9</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-1-4471-5173-9</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-1-4471-5173-9</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-1-4471-5173-9</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-1-4471-5173-9</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-1-4471-5173-9</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-1-4471-5173-9</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-1-4471-5173-9</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-1-4471-5173-9</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-1-4471-5173-9</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-1-4471-5173-9</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.BV041071808
illustrated	Not Illustrated
indexdate	2024-07-10T00:38:56Z
institution	BVB
isbn	9781447151722 9781447151739
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-026048749
oclc_num	852531969
open_access_boolean
owner	DE-473 DE-BY-UBG DE-M347 DE-20 DE-703 DE-Aug4 DE-92 DE-29 DE-859 DE-634 DE-739 DE-355 DE-BY-UBR
owner_facet	DE-473 DE-BY-UBG DE-M347 DE-20 DE-703 DE-Aug4 DE-92 DE-29 DE-859 DE-634 DE-739 DE-355 DE-BY-UBR
physical	1 Online-Ressource
psigel	ZDB-2-SCS
publishDate	2013
publishDateSearch	2013
publishDateSort	2013
publisher	Springer
record_format	marc
series2	Computer communications and networks
spelling	Erciyes, K. Verfasser aut Distributed graph algorithms for computer networks K. Erciyes London [u.a.] Springer 2013 1 Online-Ressource txt rdacontent c rdamedia cr rdacarrier Computer communications and networks Rechnernetz (DE-588)4070085-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Graphentheorie (DE-588)4113782-6 gnd rswk-swf Rechnernetz (DE-588)4070085-9 s Graphentheorie (DE-588)4113782-6 s Algorithmus (DE-588)4001183-5 s 1\p DE-604 https://doi.org/10.1007/978-1-4471-5173-9 Verlag Volltext Springer Fremddatenuebernahme application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=026048749&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis Springer Fremddatenuebernahme application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=026048749&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA Abstract 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk
spellingShingle	Erciyes, K. Distributed graph algorithms for computer networks Rechnernetz (DE-588)4070085-9 gnd Algorithmus (DE-588)4001183-5 gnd Graphentheorie (DE-588)4113782-6 gnd
subject_GND	(DE-588)4070085-9 (DE-588)4001183-5 (DE-588)4113782-6
title	Distributed graph algorithms for computer networks
title_auth	Distributed graph algorithms for computer networks
title_exact_search	Distributed graph algorithms for computer networks
title_full	Distributed graph algorithms for computer networks K. Erciyes
title_fullStr	Distributed graph algorithms for computer networks K. Erciyes
title_full_unstemmed	Distributed graph algorithms for computer networks K. Erciyes
title_short	Distributed graph algorithms for computer networks
title_sort	distributed graph algorithms for computer networks
topic	Rechnernetz (DE-588)4070085-9 gnd Algorithmus (DE-588)4001183-5 gnd Graphentheorie (DE-588)4113782-6 gnd
topic_facet	Rechnernetz Algorithmus Graphentheorie
url	https://doi.org/10.1007/978-1-4471-5173-9 http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=026048749&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=026048749&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA
work_keys_str_mv	AT erciyesk distributedgraphalgorithmsforcomputernetworks

Holdings

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection! Get full text

MARC

Record in the Search Index

There is no print copy available.

Similar Items