Cellular automata labeling of connected components in n-dimensional binary lattices

A new cellular automata-based algorithm for labeling of connected components in n -dimensional binary lattices, for n ≥ 2 , is proposed. The algorithm for 3D binary images was implemented in NetLogo and MatLab programming environments. The algorithm is local and can be efficiently implemented on dat...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	The Journal of supercomputing Ročník 72; číslo 11; s. 4221 - 4232
Hlavní autori:	Stamatovic, Biljana, Trobec, Roman
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.11.2016 Springer Nature B.V
Predmet:	Algorithms Cellular automata Compilers Computer Science Interpreters Labeling Lattices Processor Architectures Programming environments Programming Languages Connected components Parallel algorithm Data-flow Cellular automata Image Lattice Dimensional
ISSN:	0920-8542, 1573-0484
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Abstract	A new cellular automata-based algorithm for labeling of connected components in n -dimensional binary lattices, for n ≥ 2 , is proposed. The algorithm for 3D binary images was implemented in NetLogo and MatLab programming environments. The algorithm is local and can be efficiently implemented on data-flow parallel platforms with an average asymptotic complexity of O ( L ) on L n binary lattices. However, some worst-case arrangements of the n -dimensional lattice cells could require O ( L n ) calculation steps.
AbstractList	A new cellular automata-based algorithm for labeling of connected components in n-dimensional binary lattices, for n ≥ 2 , is proposed. The algorithm for 3D binary images was implemented in NetLogo and MatLab programming environments. The algorithm is local and can be efficiently implemented on data-flow parallel platforms with an average asymptotic complexity of O ( L ) on L n binary lattices. However, some worst-case arrangements of the n-dimensional lattice cells could require O ( L n ) calculation steps. A new cellular automata-based algorithm for labeling of connected components in n -dimensional binary lattices, for n ≥ 2 , is proposed. The algorithm for 3D binary images was implemented in NetLogo and MatLab programming environments. The algorithm is local and can be efficiently implemented on data-flow parallel platforms with an average asymptotic complexity of O ( L ) on L n binary lattices. However, some worst-case arrangements of the n -dimensional lattice cells could require O ( L n ) calculation steps.
Author	Trobec, Roman Stamatovic, Biljana
Author_xml	– sequence: 1 givenname: Biljana surname: Stamatovic fullname: Stamatovic, Biljana email: biljana.stamatovic@udg.edu.me organization: Faculty of information systems and technologies, University of Donja Gorica – sequence: 2 givenname: Roman surname: Trobec fullname: Trobec, Roman organization: Institute Jožef Stefan
BookMark	eNp9kE1LAzEQhoNUsK3-AG8LnqNJNptkj1L8AsGDeg752pKSzdYke_Dfm1IPIuhpZuB9Zt55V2ARp-gAuMToGiPEbzLGhHCIMIOYMwzpCVjijrcQUUEXYIl6gqDoKDkDq5x3CCHa8nYJXjcuhDmo1Ki5TKMqqglKu-DjtpmGxkwxOlOcrd24rydjyY2PTYTWjy5mP0UVGu2jSp8VLMUbl8_B6aBCdhffdQ3e7-_eNo_w-eXhaXP7DE2LWYHOWsM1ZX1HuLCmq4MlvVZaDwz3lNnOCk2QI8wwapUWXat0Z3uKqRamJe0aXB337tP0Mbtc5G6aUzWUJRYCCcooOaj4UWXSlHNygzS-qFKdl6R8kBjJQ4LymKCsCcpDgpJWEv8i98mP9dN_GXJkctXGrUs_PP0JfQEaGoYg
CitedBy_id	crossref_primary_10_1155_2017_8251305
Cites_doi	10.1142/S0129054110007337 10.1016/S1077-3142(02)00030-9 10.1109/12.45215 10.1016/S0070-2153(07)81014-3 10.1016/j.cviu.2005.04.001 10.1108/03684920310452346 10.1142/S0129183104006583 10.1016/j.patcog.2008.10.013 10.1117/12.359538 10.1016/S0921-4526(99)00675-4 10.1016/j.cviu.2003.09.002 10.1016/0167-8191(94)00099-V 10.1007/s11467-013-0403-z 10.1016/0734-189X(83)90113-5 10.1007/0-306-47015-2_51 10.1155/2014/765798 10.1016/j.advengsoft.2015.11.002 10.1109/DELTA.2008.21 10.1109/ICVGIP.2008.50 10.1145/2447976.2447989 10.1186/1687-5281-2013-21 10.1117/12.866934 10.1117/12.902126
ContentType	Journal Article
Copyright	Springer Science+Business Media New York 2016 Copyright Springer Science & Business Media 2016
Copyright_xml	– notice: Springer Science+Business Media New York 2016 – notice: Copyright Springer Science & Business Media 2016
DBID	AAYXX CITATION JQ2
DOI	10.1007/s11227-016-1761-4
DatabaseName	CrossRef ProQuest Computer Science Collection
DatabaseTitle	CrossRef ProQuest Computer Science Collection
DatabaseTitleList	ProQuest Computer Science Collection
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science
EISSN	1573-0484
EndPage	4232
ExternalDocumentID	10_1007_s11227_016_1761_4
GroupedDBID	-4Z -59 -5G -BR -EM -Y2 -~C .4S .86 .DC .VR 06D 0R~ 0VY 123 199 1N0 1SB 2.D 203 28- 29L 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5QI 5VS 67Z 6NX 78A 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYOK AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDBF ABDPE ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACUHS ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADMLS ADQRH ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHSBF AHYZX AI. AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARCSS ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. B0M BA0 BBWZM BDATZ BGNMA BSONS CAG COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 EAD EAP EAS EBD EBLON EBS EDO EIOEI EJD EMK EPL ESBYG ESX F5P FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I-F I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV KOW LAK LLZTM M4Y MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM OVD P19 P2P P9O PF0 PT4 PT5 QOK QOS R4E R89 R9I RHV RNI ROL RPX RSV RZC RZE RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TEORI TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW VH1 W23 W48 WH7 WK8 YLTOR Z45 Z7R Z7X Z7Z Z83 Z88 Z8M Z8N Z8R Z8T Z8W Z92 ZMTXR ~8M ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABJCF ABRTQ ACSTC ADHKG ADKFA AEZWR AFDZB AFFHD AFHIU AFKRA AFOHR AGQPQ AHPBZ AHWEU AIXLP ARAPS ATHPR AYFIA BENPR BGLVJ CCPQU CITATION HCIFZ K7- M7S PHGZM PHGZT PQGLB PTHSS JQ2
ID	FETCH-LOGICAL-c316t-eddc7b4695278dc5c7bd29babbf61946d5d8b20e26c64dab853ab5d9414b8c323
IEDL.DBID	RSV
ISICitedReferencesCount	2
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000387234200010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0920-8542
IngestDate	Thu Sep 25 00:42:15 EDT 2025 Tue Nov 18 20:15:32 EST 2025 Sat Nov 29 06:13:09 EST 2025 Fri Feb 21 02:27:40 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	11
Keywords	Connected components Parallel algorithm Data-flow Cellular automata Image Lattice Dimensional
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c316t-eddc7b4695278dc5c7bd29babbf61946d5d8b20e26c64dab853ab5d9414b8c323
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
PQID	1880846422
PQPubID	2043774
PageCount	12
ParticipantIDs	proquest_journals_1880846422 crossref_citationtrail_10_1007_s11227_016_1761_4 crossref_primary_10_1007_s11227_016_1761_4 springer_journals_10_1007_s11227_016_1761_4
PublicationCentury	2000
PublicationDate	2016-11-01
PublicationDateYYYYMMDD	2016-11-01
PublicationDate_xml	– month: 11 year: 2016 text: 2016-11-01 day: 01
PublicationDecade	2010
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationSubtitle	An International Journal of High-Performance Computer Design, Analysis, and Use
PublicationTitle	The Journal of supercomputing
PublicationTitleAbbrev	J Supercomput
PublicationYear	2016
Publisher	Springer US Springer Nature B.V
Publisher_xml	– name: Springer US – name: Springer Nature B.V
References	Crookes, Benkrid (CR15) 1999; 3844 Wilensky, Rand (CR24) 2015 Ito, Nakano (CR28) 2010; 21 CR17 CR16 Hu, Qian, Nowinski (CR10) 2005; 99 CR13 Oliveira, Coelho, Monteiro (CR19) 2004; 15 CR12 CR31 Yin, Tao (CR4) 2000; 279 Hoekstra, Kroc, Sloot (CR29) 2010 Hatzikirou, Deutsch (CR20) 2008; 81 He, Chao, Suzuki, Wu (CR1) 2009; 42 Suzuki, Horiba, Sugie (CR2) 2003; 89 CR3 CR6 Manohar, Ramapriyan (CR11) 1989; 45 Xu, Wang, Lv, Deng (CR32) 2014; 9 CR7 Wuensche (CR18) 2003; 32 Cannataro, Gregorio, Rongo, Spataro, Spezzano, Talia (CR23) 1995; 21 CR27 Cypher, Snyder, Sanz (CR30) 1990; 39 CR26 CR25 Benkrid, Sukhsawas, Crookes, Benkrid (CR14) 2003 CR22 CR21 Lumia (CR9) 1983; 23 Chang, Chen, Lu (CR8) 2004; 93 He, Chao, Suzuki (CR5) 2012; II WG Yin (1761_CR4) 2000; 279 M Manohar (1761_CR11) 1989; 45 A Wuensche (1761_CR18) 2003; 32 K Suzuki (1761_CR2) 2003; 89 AG Hoekstra (1761_CR29) 2010 1761_CR21 X Xu (1761_CR32) 2014; 9 1761_CR22 M Cannataro (1761_CR23) 1995; 21 1761_CR27 1761_CR3 1761_CR25 1761_CR26 L He (1761_CR1) 2009; 42 RE Cypher (1761_CR30) 1990; 39 U Wilensky (1761_CR24) 2015 1761_CR6 1761_CR7 D Crookes (1761_CR15) 1999; 3844 H Hatzikirou (1761_CR20) 2008; 81 Q Hu (1761_CR10) 2005; 99 F Chang (1761_CR8) 2004; 93 1761_CR31 K Benkrid (1761_CR14) 2003 L He (1761_CR5) 2012; II 1761_CR12 1761_CR13 1761_CR16 1761_CR17 R Lumia (1761_CR9) 1983; 23 GMB Oliveira (1761_CR19) 2004; 15 Y Ito (1761_CR28) 2010; 21
References_xml	– ident: CR22 – volume: 45 start-page: 143 year: 1989 end-page: 149 ident: CR11 article-title: Connected component labeling of binary images on a mesh connected massively parallel processor publication-title: Comput Vis Gr Image Process – ident: CR16 – volume: 21 start-page: 405 year: 2010 end-page: 425 ident: CR28 article-title: Low-latency connected component labeling using an FPGA publication-title: Int J Found Comput Sci doi: 10.1142/S0129054110007337 – ident: CR12 – volume: II start-page: 1141 year: 2012 end-page: 1146 ident: CR5 article-title: A new two-scan algorithm for labeling connected components in binary images publication-title: Proc World Congr Eng – year: 2015 ident: CR24 publication-title: An introduction to agent-based modeling – year: 2010 ident: CR29 publication-title: Simulating complex systems by cellular automata – ident: CR6 – volume: 89 start-page: 1 year: 2003 end-page: 23 ident: CR2 article-title: Linear-time connected-component labeling based on sequential local operations publication-title: Comput Vis Image Underst doi: 10.1016/S1077-3142(02)00030-9 – volume: 39 start-page: 276 year: 1990 end-page: 281 ident: CR30 article-title: Practical algorithms for image component labeling on SIMD mesh connected computers publication-title: IEEE Trans Comput doi: 10.1109/12.45215 – volume: 81 start-page: 401 year: 2008 end-page: 434 ident: CR20 article-title: Cellular automata as microscopic models of cell migration in heterogeneous environments publication-title: Curr Top Dev Biol doi: 10.1016/S0070-2153(07)81014-3 – ident: CR25 – volume: 99 start-page: 414 year: 2005 end-page: 434 ident: CR10 article-title: Fast connected-component labelling in three-dimensional binary images based on iterative recursion publication-title: Comput Vis Image Underst doi: 10.1016/j.cviu.2005.04.001 – ident: CR27 – ident: CR21 – ident: CR3 – volume: 32 start-page: 77 year: 2003 end-page: 104 ident: CR18 article-title: Discrete dynamics lab: tools for investigating cellular automata and discrete dynamical networks publication-title: Kybernetes doi: 10.1108/03684920310452346 – year: 2003 ident: CR14 publication-title: An FPGA-based image connected component labeller, field-programmable logic and applications – ident: CR17 – volume: 15 start-page: 1061 year: 2004 end-page: 1068 ident: CR19 article-title: Cellular automata cryptographic model based on bi-directional toggle rules publication-title: Int J Modern Phys C doi: 10.1142/S0129183104006583 – ident: CR31 – ident: CR13 – volume: 42 start-page: 1977 year: 2009 end-page: 1987 ident: CR1 article-title: Fast connected-component labeling publication-title: Pattern Recogn doi: 10.1016/j.patcog.2008.10.013 – volume: 3844 start-page: 17 year: 1999 end-page: 23 ident: CR15 article-title: FPGA implementation of image component labelling publication-title: Proc SPIE, Reconfig Technol FPGAs Comput Appl doi: 10.1117/12.359538 – volume: 279 start-page: 84 year: 2000 end-page: 86 ident: CR4 article-title: Algorithm for finding two-dimensional site percolation backbones publication-title: Phys B doi: 10.1016/S0921-4526(99)00675-4 – volume: 93 start-page: 206 year: 2004 end-page: 220 ident: CR8 article-title: A linear-time component-labeling algorithm using contour tracing technique publication-title: Comput Vis Image Underst doi: 10.1016/j.cviu.2003.09.002 – ident: CR7 – volume: 21 start-page: 803 year: 1995 end-page: 824 ident: CR23 article-title: Parallel cellular automata environment on multicomputers for computational science publication-title: Parallel Comput doi: 10.1016/0167-8191(94)00099-V – volume: 9 start-page: 113 year: 2014 end-page: 119 ident: CR32 article-title: Simultaneous analysis of three-dimensional percolation models publication-title: Front Phys doi: 10.1007/s11467-013-0403-z – volume: 23 start-page: 207 year: 1983 end-page: 217 ident: CR9 article-title: A new three-dimensional connected components algorithm publication-title: Comput Vis Gr Image Process doi: 10.1016/0734-189X(83)90113-5 – ident: CR26 – volume: 32 start-page: 77 year: 2003 ident: 1761_CR18 publication-title: Kybernetes doi: 10.1108/03684920310452346 – volume: 3844 start-page: 17 year: 1999 ident: 1761_CR15 publication-title: Proc SPIE, Reconfig Technol FPGAs Comput Appl doi: 10.1117/12.359538 – ident: 1761_CR22 doi: 10.1007/0-306-47015-2_51 – ident: 1761_CR25 doi: 10.1155/2014/765798 – volume: 23 start-page: 207 year: 1983 ident: 1761_CR9 publication-title: Comput Vis Gr Image Process doi: 10.1016/0734-189X(83)90113-5 – ident: 1761_CR3 doi: 10.1016/j.advengsoft.2015.11.002 – volume: 9 start-page: 113 year: 2014 ident: 1761_CR32 publication-title: Front Phys doi: 10.1007/s11467-013-0403-z – volume: 89 start-page: 1 year: 2003 ident: 1761_CR2 publication-title: Comput Vis Image Underst doi: 10.1016/S1077-3142(02)00030-9 – ident: 1761_CR13 doi: 10.1109/DELTA.2008.21 – volume: 15 start-page: 1061 year: 2004 ident: 1761_CR19 publication-title: Int J Modern Phys C doi: 10.1142/S0129183104006583 – volume: 99 start-page: 414 year: 2005 ident: 1761_CR10 publication-title: Comput Vis Image Underst doi: 10.1016/j.cviu.2005.04.001 – ident: 1761_CR16 doi: 10.1109/ICVGIP.2008.50 – ident: 1761_CR31 doi: 10.1145/2447976.2447989 – ident: 1761_CR26 – volume: 42 start-page: 1977 year: 2009 ident: 1761_CR1 publication-title: Pattern Recogn doi: 10.1016/j.patcog.2008.10.013 – volume-title: An introduction to agent-based modeling year: 2015 ident: 1761_CR24 – volume-title: Simulating complex systems by cellular automata year: 2010 ident: 1761_CR29 – ident: 1761_CR12 doi: 10.1186/1687-5281-2013-21 – volume: 279 start-page: 84 year: 2000 ident: 1761_CR4 publication-title: Phys B doi: 10.1016/S0921-4526(99)00675-4 – ident: 1761_CR6 doi: 10.1117/12.866934 – ident: 1761_CR7 – volume: 93 start-page: 206 year: 2004 ident: 1761_CR8 publication-title: Comput Vis Image Underst doi: 10.1016/j.cviu.2003.09.002 – volume: 81 start-page: 401 year: 2008 ident: 1761_CR20 publication-title: Curr Top Dev Biol doi: 10.1016/S0070-2153(07)81014-3 – volume-title: An FPGA-based image connected component labeller, field-programmable logic and applications year: 2003 ident: 1761_CR14 – volume: 45 start-page: 143 year: 1989 ident: 1761_CR11 publication-title: Comput Vis Gr Image Process – volume: 39 start-page: 276 year: 1990 ident: 1761_CR30 publication-title: IEEE Trans Comput doi: 10.1109/12.45215 – ident: 1761_CR17 doi: 10.1117/12.902126 – ident: 1761_CR27 – volume: 21 start-page: 405 year: 2010 ident: 1761_CR28 publication-title: Int J Found Comput Sci doi: 10.1142/S0129054110007337 – ident: 1761_CR21 – volume: 21 start-page: 803 year: 1995 ident: 1761_CR23 publication-title: Parallel Comput doi: 10.1016/0167-8191(94)00099-V – volume: II start-page: 1141 year: 2012 ident: 1761_CR5 publication-title: Proc World Congr Eng
SSID	ssj0004373
Score	2.0795884
Snippet	A new cellular automata-based algorithm for labeling of connected components in n -dimensional binary lattices, for n ≥ 2 , is proposed. The algorithm for 3D... A new cellular automata-based algorithm for labeling of connected components in n-dimensional binary lattices, for n ≥ 2 , is proposed. The algorithm for 3D...
SourceID	proquest crossref springer
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	4221
SubjectTerms	Algorithms Cellular automata Compilers Computer Science Interpreters Labeling Lattices Processor Architectures Programming environments Programming Languages
Title	Cellular automata labeling of connected components in n-dimensional binary lattices
URI	https://link.springer.com/article/10.1007/s11227-016-1761-4 https://www.proquest.com/docview/1880846422
Volume	72
WOSCitedRecordID	wos000387234200010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVAVX databaseName: Springer LINK customDbUrl: eissn: 1573-0484 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004373 issn: 0920-8542 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8QwEB509eDF9Ymrq-TgSSm0adMmR1lcPMgirC57K3kVFpau2K6_30wfVkUFPZYmIWQmyUzmm28ALqkUoZ9lxpMmCb1IC-Zxd1R6LIuMpFb5smLgm90nkwmfz8VDk8ddtGj3NiRZndRdsltAKcIkYyQ1dI7PJmwxJJtBF30665IhwzqsLJxfxFlE21Dmd0N8vow6C_NLULS6a8b9f81yD3Yb05Lc1LqwDxs2P4B-W7aBNLv4EKYju1wi-pTIdblyFqskThWqvHSyyohG6It2hihBuPkqR6QFWeQk9wxWAqhZPIiq8nhdxxLRc8URPI1vH0d3XlNbwdNhEJeeNUYnyvnGjCbcaOY-DBVKKpXhu0ZsmOGK-pbGOnZSU-5Wl4oZEQWR4jqk4TH0cjeFEyDcmlgaYZTBvFzJRMA5ywSTQmbWan8AfrvIqW6Ix7H-xTLtKJNx0VIEm-GipdEArt67PNesG781HraSS5sNWKRIM-dMq4jSAVy3kvrw-6fBTv_U-gx2aCVqfJIZQq98Wdtz2Nav5aJ4uaj08g3yrN2i
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dS8MwED90Cvri_MTp1Dz4pBS6tGmTRxmOiXMIm2NvJV8FYXSydf795rrWqaigj6VJCLlLcpf73e8ALqkUgZ-mxpMmDrxQC-Zxd1R6LA2NpFb5smDgG_Xifp-Px-KxzOOeV2j3KiRZnNSrZLcWpQiTjJDU0Dk-67ARYpUddNEHo1UyZLAMKwvnF3EW0iqU-d0Qny-jlYX5JSha3DWd-r9muQs7pWlJbpa6sAdrNtuHelW2gZS7-AAGbTuZIPqUyEU-dRarJE4Virx0Mk2JRuiLdoYoQbj5NEOkBXnOSOYZrASwZPEgqsjjdR1zRM_ND-Gpcztsd72ytoKng1aUe9YYHSvnGzMac6OZ-zBUKKlUiu8akWGGK-pbGunISU25W10qZkTYChXXAQ2OoJa5KRwD4dZE0gijDOblSiZanLNUMClkaq32G-BXi5zokngc619MkhVlMi5agmAzXLQkbMDVe5eXJevGb42bleSScgPOE6SZc6ZVSGkDritJffj902Anf2p9AVvd4UMv6d31709hmxZix-eZJtTy2cKewaZ-zZ_ns_NCR98AXz7ghg
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8QwEB50FfHi-sT1mYMnpWw3bdrkKKuLoiziquyt5FUQlq641d9vpg-rooJ4LE1CyEySmcw33wAcUSkCP02NJ00ceKEWzOPuqPRYGhpJrfJlwcD3cB0Ph3w8FjdVndNZjXavQ5JlTgOyNGV598mk3SbxrUcpQiYjJDh0TtA8LITOkUFM1-3ooUmMDMoQs3A-EmchrcOa3w3x-WJqrM0vAdLi3hm0_z3jVVipTE5yWurIGszZbB3adTkHUu3uDRj17WSCqFQiX_Kps2QlcSpS5KuTaUo0QmK0M1AJwtCnGSIwyGNGMs9ghYCS3YOoIr_XdcwRVTfbhPvB-V3_wqtqLng66EW5Z43RsXI-M6MxN5q5D0OFkkql-N4RGWa4or6lkY6cNJW77aViRoS9UHEd0GALWpmbwjYQbk0kjTDKYL6uZKLHOUsFk0Km1mq_A3694ImuCMmxLsYkaaiUcdESBKHhoiVhB47fuzyVbBy_Nd6rpZhUG3OWIP2cM7lCSjtwUkvtw--fBtv5U-tDWLo5GyTXl8OrXVimhdTx1WYPWvnzi92HRf2aP86eDwp1fQOrW-lq
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Cellular+automata+labeling+of+connected+components+in+n-dimensional+binary+lattices&rft.jtitle=The+Journal+of+supercomputing&rft.au=Stamatovic%2C+Biljana&rft.au=Trobec%2C+Roman&rft.date=2016-11-01&rft.pub=Springer+Nature+B.V&rft.issn=0920-8542&rft.eissn=1573-0484&rft.volume=72&rft.issue=11&rft.spage=4221&rft.epage=4232&rft_id=info:doi/10.1007%2Fs11227-016-1761-4&rft.externalDBID=NO_FULL_TEXT
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0920-8542&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0920-8542&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0920-8542&client=summon