Fault tolerability analysis of folded crossed cubes based on
As data center networks and network-on-chip are developing rapidly, many graph invariants have been proposed to measure the reliability and fault tolerance of the network so that the multiprocessor systems can be ensured to operate efficiently and smoothly. The g-component connectivity of a graph G,...
Ausführliche Beschreibung
Autor*in: |
Niu, Baohua [verfasserIn] Zhou, Shuming [verfasserIn] Zhang, Hong [verfasserIn] Zhang, Qifan [verfasserIn] |
---|
Format: |
E-Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
2023 |
---|
Schlagwörter: |
---|
Übergeordnetes Werk: |
Enthalten in: Theoretical computer science - Amsterdam [u.a.] : Elsevier, 1975, 959 |
---|---|
Übergeordnetes Werk: |
volume:959 |
DOI / URN: |
10.1016/j.tcs.2023.113858 |
---|
Katalog-ID: |
ELV065264770 |
---|
LEADER | 01000caa a22002652 4500 | ||
---|---|---|---|
001 | ELV065264770 | ||
003 | DE-627 | ||
005 | 20231027093050.0 | ||
007 | cr uuu---uuuuu | ||
008 | 231026s2023 xx |||||o 00| ||eng c | ||
024 | 7 | |a 10.1016/j.tcs.2023.113858 |2 doi | |
035 | |a (DE-627)ELV065264770 | ||
035 | |a (ELSEVIER)S0304-3975(23)00171-8 | ||
040 | |a DE-627 |b ger |c DE-627 |e rda | ||
041 | |a eng | ||
082 | 0 | 4 | |a 004 |q VZ |
084 | |a 54.10 |2 bkl | ||
100 | 1 | |a Niu, Baohua |e verfasserin |4 aut | |
245 | 1 | 0 | |a Fault tolerability analysis of folded crossed cubes based on |
264 | 1 | |c 2023 | |
336 | |a nicht spezifiziert |b zzz |2 rdacontent | ||
337 | |a Computermedien |b c |2 rdamedia | ||
338 | |a Online-Ressource |b cr |2 rdacarrier | ||
520 | |a As data center networks and network-on-chip are developing rapidly, many graph invariants have been proposed to measure the reliability and fault tolerance of the network so that the multiprocessor systems can be ensured to operate efficiently and smoothly. The g-component connectivity of a graph G, denoted by c κ g ( G ) , is the minimum size of vertex cut such that G has at least g components. The g-good neighbor connectivity of a graph G, represented by κ g ( G ) , is the minimum size of vertex cut such that each vertex has at least g fault-free neighbors. Motivated by the conditional connectivities above, the g-component diagnosability ( c t g ( G ) ) and g-good neighbor diagnosability ( t g ( G ) ) of graph G have been suggested to evaluate the fault diagnostic capability of multiprocessor systems successively. In this paper, we determine the ( g + 1 ) -component connectivity of folded crossed cubes F C Q n , i.e., c κ g + 1 ( F C Q n ) = n g − g 2 2 + g 2 + 1 for 1 ≤ g ≤ ⌊ n 2 ⌋ , and ( g + 1 ) -component diagnosability of F C Q n under the PMC model and MM ⁎ model, i.e., c t g + 1 ( F C Q n ) = n g + n − g 2 2 − g 2 + 1 . Moreover, we establish the g-good neighbor connectivity of F C Q n , i.e., κ g ( F C Q n ) = ( n + 1 − g ) 2 g for 0 ≤ g ≤ n − 5 , and g-good neighbor diagnosability of F C Q n under the PMC model and MM ⁎ model, i.e., t g ( F C Q n ) = ( n + 2 − g ) 2 g − 1 . | ||
650 | 4 | |a Diagnosability | |
650 | 4 | |a PMC model | |
650 | 4 | |a Folded crossed cube | |
700 | 1 | |a Zhou, Shuming |e verfasserin |0 (orcid)0000-0002-2114-7162 |4 aut | |
700 | 1 | |a Zhang, Hong |e verfasserin |4 aut | |
700 | 1 | |a Zhang, Qifan |e verfasserin |4 aut | |
773 | 0 | 8 | |i Enthalten in |t Theoretical computer science |d Amsterdam [u.a.] : Elsevier, 1975 |g 959 |h Online-Ressource |w (DE-627)265784174 |w (DE-600)1466347-8 |w (DE-576)074891030 |7 nnns |
773 | 1 | 8 | |g volume:959 |
912 | |a GBV_USEFLAG_U | ||
912 | |a GBV_ELV | ||
912 | |a SYSFLAG_U | ||
912 | |a GBV_ILN_20 | ||
912 | |a GBV_ILN_22 | ||
912 | |a GBV_ILN_23 | ||
912 | |a GBV_ILN_24 | ||
912 | |a GBV_ILN_31 | ||
912 | |a GBV_ILN_32 | ||
912 | |a GBV_ILN_40 | ||
912 | |a GBV_ILN_60 | ||
912 | |a GBV_ILN_62 | ||
912 | |a GBV_ILN_65 | ||
912 | |a GBV_ILN_69 | ||
912 | |a GBV_ILN_70 | ||
912 | |a GBV_ILN_73 | ||
912 | |a GBV_ILN_74 | ||
912 | |a GBV_ILN_90 | ||
912 | |a GBV_ILN_95 | ||
912 | |a GBV_ILN_100 | ||
912 | |a GBV_ILN_101 | ||
912 | |a GBV_ILN_105 | ||
912 | |a GBV_ILN_110 | ||
912 | |a GBV_ILN_150 | ||
912 | |a GBV_ILN_151 | ||
912 | |a GBV_ILN_187 | ||
912 | |a GBV_ILN_213 | ||
912 | |a GBV_ILN_224 | ||
912 | |a GBV_ILN_230 | ||
912 | |a GBV_ILN_370 | ||
912 | |a GBV_ILN_602 | ||
912 | |a GBV_ILN_702 | ||
912 | |a GBV_ILN_2001 | ||
912 | |a GBV_ILN_2003 | ||
912 | |a GBV_ILN_2004 | ||
912 | |a GBV_ILN_2005 | ||
912 | |a GBV_ILN_2007 | ||
912 | |a GBV_ILN_2008 | ||
912 | |a GBV_ILN_2009 | ||
912 | |a GBV_ILN_2010 | ||
912 | |a GBV_ILN_2011 | ||
912 | |a GBV_ILN_2014 | ||
912 | |a GBV_ILN_2015 | ||
912 | |a GBV_ILN_2020 | ||
912 | |a GBV_ILN_2021 | ||
912 | |a GBV_ILN_2025 | ||
912 | |a GBV_ILN_2026 | ||
912 | |a GBV_ILN_2027 | ||
912 | |a GBV_ILN_2034 | ||
912 | |a GBV_ILN_2044 | ||
912 | |a GBV_ILN_2048 | ||
912 | |a GBV_ILN_2049 | ||
912 | |a GBV_ILN_2050 | ||
912 | |a GBV_ILN_2055 | ||
912 | |a GBV_ILN_2056 | ||
912 | |a GBV_ILN_2059 | ||
912 | |a GBV_ILN_2061 | ||
912 | |a GBV_ILN_2064 | ||
912 | |a GBV_ILN_2088 | ||
912 | |a GBV_ILN_2106 | ||
912 | |a GBV_ILN_2110 | ||
912 | |a GBV_ILN_2111 | ||
912 | |a GBV_ILN_2112 | ||
912 | |a GBV_ILN_2122 | ||
912 | |a GBV_ILN_2129 | ||
912 | |a GBV_ILN_2143 | ||
912 | |a GBV_ILN_2152 | ||
912 | |a GBV_ILN_2153 | ||
912 | |a GBV_ILN_2190 | ||
912 | |a GBV_ILN_2232 | ||
912 | |a GBV_ILN_2336 | ||
912 | |a GBV_ILN_2470 | ||
912 | |a GBV_ILN_2507 | ||
912 | |a GBV_ILN_4012 | ||
912 | |a GBV_ILN_4035 | ||
912 | |a GBV_ILN_4037 | ||
912 | |a GBV_ILN_4112 | ||
912 | |a GBV_ILN_4125 | ||
912 | |a GBV_ILN_4126 | ||
912 | |a GBV_ILN_4242 | ||
912 | |a GBV_ILN_4249 | ||
912 | |a GBV_ILN_4251 | ||
912 | |a GBV_ILN_4305 | ||
912 | |a GBV_ILN_4306 | ||
912 | |a GBV_ILN_4307 | ||
912 | |a GBV_ILN_4313 | ||
912 | |a GBV_ILN_4322 | ||
912 | |a GBV_ILN_4323 | ||
912 | |a GBV_ILN_4324 | ||
912 | |a GBV_ILN_4325 | ||
912 | |a GBV_ILN_4326 | ||
912 | |a GBV_ILN_4333 | ||
912 | |a GBV_ILN_4334 | ||
912 | |a GBV_ILN_4335 | ||
912 | |a GBV_ILN_4338 | ||
912 | |a GBV_ILN_4367 | ||
912 | |a GBV_ILN_4393 | ||
912 | |a GBV_ILN_4700 | ||
936 | b | k | |a 54.10 |j Theoretische Informatik |q VZ |
951 | |a AR | ||
952 | |d 959 |
author_variant |
b n bn s z sz h z hz q z qz |
---|---|
matchkey_str |
niubaohuazhoushumingzhanghongzhangqifan:2023----:altlrbltaayioflecos |
hierarchy_sort_str |
2023 |
bklnumber |
54.10 |
publishDate |
2023 |
allfields |
10.1016/j.tcs.2023.113858 doi (DE-627)ELV065264770 (ELSEVIER)S0304-3975(23)00171-8 DE-627 ger DE-627 rda eng 004 VZ 54.10 bkl Niu, Baohua verfasserin aut Fault tolerability analysis of folded crossed cubes based on 2023 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier As data center networks and network-on-chip are developing rapidly, many graph invariants have been proposed to measure the reliability and fault tolerance of the network so that the multiprocessor systems can be ensured to operate efficiently and smoothly. The g-component connectivity of a graph G, denoted by c κ g ( G ) , is the minimum size of vertex cut such that G has at least g components. The g-good neighbor connectivity of a graph G, represented by κ g ( G ) , is the minimum size of vertex cut such that each vertex has at least g fault-free neighbors. Motivated by the conditional connectivities above, the g-component diagnosability ( c t g ( G ) ) and g-good neighbor diagnosability ( t g ( G ) ) of graph G have been suggested to evaluate the fault diagnostic capability of multiprocessor systems successively. In this paper, we determine the ( g + 1 ) -component connectivity of folded crossed cubes F C Q n , i.e., c κ g + 1 ( F C Q n ) = n g − g 2 2 + g 2 + 1 for 1 ≤ g ≤ ⌊ n 2 ⌋ , and ( g + 1 ) -component diagnosability of F C Q n under the PMC model and MM ⁎ model, i.e., c t g + 1 ( F C Q n ) = n g + n − g 2 2 − g 2 + 1 . Moreover, we establish the g-good neighbor connectivity of F C Q n , i.e., κ g ( F C Q n ) = ( n + 1 − g ) 2 g for 0 ≤ g ≤ n − 5 , and g-good neighbor diagnosability of F C Q n under the PMC model and MM ⁎ model, i.e., t g ( F C Q n ) = ( n + 2 − g ) 2 g − 1 . Diagnosability PMC model Folded crossed cube Zhou, Shuming verfasserin (orcid)0000-0002-2114-7162 aut Zhang, Hong verfasserin aut Zhang, Qifan verfasserin aut Enthalten in Theoretical computer science Amsterdam [u.a.] : Elsevier, 1975 959 Online-Ressource (DE-627)265784174 (DE-600)1466347-8 (DE-576)074891030 nnns volume:959 GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4393 GBV_ILN_4700 54.10 Theoretische Informatik VZ AR 959 |
spelling |
10.1016/j.tcs.2023.113858 doi (DE-627)ELV065264770 (ELSEVIER)S0304-3975(23)00171-8 DE-627 ger DE-627 rda eng 004 VZ 54.10 bkl Niu, Baohua verfasserin aut Fault tolerability analysis of folded crossed cubes based on 2023 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier As data center networks and network-on-chip are developing rapidly, many graph invariants have been proposed to measure the reliability and fault tolerance of the network so that the multiprocessor systems can be ensured to operate efficiently and smoothly. The g-component connectivity of a graph G, denoted by c κ g ( G ) , is the minimum size of vertex cut such that G has at least g components. The g-good neighbor connectivity of a graph G, represented by κ g ( G ) , is the minimum size of vertex cut such that each vertex has at least g fault-free neighbors. Motivated by the conditional connectivities above, the g-component diagnosability ( c t g ( G ) ) and g-good neighbor diagnosability ( t g ( G ) ) of graph G have been suggested to evaluate the fault diagnostic capability of multiprocessor systems successively. In this paper, we determine the ( g + 1 ) -component connectivity of folded crossed cubes F C Q n , i.e., c κ g + 1 ( F C Q n ) = n g − g 2 2 + g 2 + 1 for 1 ≤ g ≤ ⌊ n 2 ⌋ , and ( g + 1 ) -component diagnosability of F C Q n under the PMC model and MM ⁎ model, i.e., c t g + 1 ( F C Q n ) = n g + n − g 2 2 − g 2 + 1 . Moreover, we establish the g-good neighbor connectivity of F C Q n , i.e., κ g ( F C Q n ) = ( n + 1 − g ) 2 g for 0 ≤ g ≤ n − 5 , and g-good neighbor diagnosability of F C Q n under the PMC model and MM ⁎ model, i.e., t g ( F C Q n ) = ( n + 2 − g ) 2 g − 1 . Diagnosability PMC model Folded crossed cube Zhou, Shuming verfasserin (orcid)0000-0002-2114-7162 aut Zhang, Hong verfasserin aut Zhang, Qifan verfasserin aut Enthalten in Theoretical computer science Amsterdam [u.a.] : Elsevier, 1975 959 Online-Ressource (DE-627)265784174 (DE-600)1466347-8 (DE-576)074891030 nnns volume:959 GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4393 GBV_ILN_4700 54.10 Theoretische Informatik VZ AR 959 |
allfields_unstemmed |
10.1016/j.tcs.2023.113858 doi (DE-627)ELV065264770 (ELSEVIER)S0304-3975(23)00171-8 DE-627 ger DE-627 rda eng 004 VZ 54.10 bkl Niu, Baohua verfasserin aut Fault tolerability analysis of folded crossed cubes based on 2023 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier As data center networks and network-on-chip are developing rapidly, many graph invariants have been proposed to measure the reliability and fault tolerance of the network so that the multiprocessor systems can be ensured to operate efficiently and smoothly. The g-component connectivity of a graph G, denoted by c κ g ( G ) , is the minimum size of vertex cut such that G has at least g components. The g-good neighbor connectivity of a graph G, represented by κ g ( G ) , is the minimum size of vertex cut such that each vertex has at least g fault-free neighbors. Motivated by the conditional connectivities above, the g-component diagnosability ( c t g ( G ) ) and g-good neighbor diagnosability ( t g ( G ) ) of graph G have been suggested to evaluate the fault diagnostic capability of multiprocessor systems successively. In this paper, we determine the ( g + 1 ) -component connectivity of folded crossed cubes F C Q n , i.e., c κ g + 1 ( F C Q n ) = n g − g 2 2 + g 2 + 1 for 1 ≤ g ≤ ⌊ n 2 ⌋ , and ( g + 1 ) -component diagnosability of F C Q n under the PMC model and MM ⁎ model, i.e., c t g + 1 ( F C Q n ) = n g + n − g 2 2 − g 2 + 1 . Moreover, we establish the g-good neighbor connectivity of F C Q n , i.e., κ g ( F C Q n ) = ( n + 1 − g ) 2 g for 0 ≤ g ≤ n − 5 , and g-good neighbor diagnosability of F C Q n under the PMC model and MM ⁎ model, i.e., t g ( F C Q n ) = ( n + 2 − g ) 2 g − 1 . Diagnosability PMC model Folded crossed cube Zhou, Shuming verfasserin (orcid)0000-0002-2114-7162 aut Zhang, Hong verfasserin aut Zhang, Qifan verfasserin aut Enthalten in Theoretical computer science Amsterdam [u.a.] : Elsevier, 1975 959 Online-Ressource (DE-627)265784174 (DE-600)1466347-8 (DE-576)074891030 nnns volume:959 GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4393 GBV_ILN_4700 54.10 Theoretische Informatik VZ AR 959 |
allfieldsGer |
10.1016/j.tcs.2023.113858 doi (DE-627)ELV065264770 (ELSEVIER)S0304-3975(23)00171-8 DE-627 ger DE-627 rda eng 004 VZ 54.10 bkl Niu, Baohua verfasserin aut Fault tolerability analysis of folded crossed cubes based on 2023 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier As data center networks and network-on-chip are developing rapidly, many graph invariants have been proposed to measure the reliability and fault tolerance of the network so that the multiprocessor systems can be ensured to operate efficiently and smoothly. The g-component connectivity of a graph G, denoted by c κ g ( G ) , is the minimum size of vertex cut such that G has at least g components. The g-good neighbor connectivity of a graph G, represented by κ g ( G ) , is the minimum size of vertex cut such that each vertex has at least g fault-free neighbors. Motivated by the conditional connectivities above, the g-component diagnosability ( c t g ( G ) ) and g-good neighbor diagnosability ( t g ( G ) ) of graph G have been suggested to evaluate the fault diagnostic capability of multiprocessor systems successively. In this paper, we determine the ( g + 1 ) -component connectivity of folded crossed cubes F C Q n , i.e., c κ g + 1 ( F C Q n ) = n g − g 2 2 + g 2 + 1 for 1 ≤ g ≤ ⌊ n 2 ⌋ , and ( g + 1 ) -component diagnosability of F C Q n under the PMC model and MM ⁎ model, i.e., c t g + 1 ( F C Q n ) = n g + n − g 2 2 − g 2 + 1 . Moreover, we establish the g-good neighbor connectivity of F C Q n , i.e., κ g ( F C Q n ) = ( n + 1 − g ) 2 g for 0 ≤ g ≤ n − 5 , and g-good neighbor diagnosability of F C Q n under the PMC model and MM ⁎ model, i.e., t g ( F C Q n ) = ( n + 2 − g ) 2 g − 1 . Diagnosability PMC model Folded crossed cube Zhou, Shuming verfasserin (orcid)0000-0002-2114-7162 aut Zhang, Hong verfasserin aut Zhang, Qifan verfasserin aut Enthalten in Theoretical computer science Amsterdam [u.a.] : Elsevier, 1975 959 Online-Ressource (DE-627)265784174 (DE-600)1466347-8 (DE-576)074891030 nnns volume:959 GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4393 GBV_ILN_4700 54.10 Theoretische Informatik VZ AR 959 |
allfieldsSound |
10.1016/j.tcs.2023.113858 doi (DE-627)ELV065264770 (ELSEVIER)S0304-3975(23)00171-8 DE-627 ger DE-627 rda eng 004 VZ 54.10 bkl Niu, Baohua verfasserin aut Fault tolerability analysis of folded crossed cubes based on 2023 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier As data center networks and network-on-chip are developing rapidly, many graph invariants have been proposed to measure the reliability and fault tolerance of the network so that the multiprocessor systems can be ensured to operate efficiently and smoothly. The g-component connectivity of a graph G, denoted by c κ g ( G ) , is the minimum size of vertex cut such that G has at least g components. The g-good neighbor connectivity of a graph G, represented by κ g ( G ) , is the minimum size of vertex cut such that each vertex has at least g fault-free neighbors. Motivated by the conditional connectivities above, the g-component diagnosability ( c t g ( G ) ) and g-good neighbor diagnosability ( t g ( G ) ) of graph G have been suggested to evaluate the fault diagnostic capability of multiprocessor systems successively. In this paper, we determine the ( g + 1 ) -component connectivity of folded crossed cubes F C Q n , i.e., c κ g + 1 ( F C Q n ) = n g − g 2 2 + g 2 + 1 for 1 ≤ g ≤ ⌊ n 2 ⌋ , and ( g + 1 ) -component diagnosability of F C Q n under the PMC model and MM ⁎ model, i.e., c t g + 1 ( F C Q n ) = n g + n − g 2 2 − g 2 + 1 . Moreover, we establish the g-good neighbor connectivity of F C Q n , i.e., κ g ( F C Q n ) = ( n + 1 − g ) 2 g for 0 ≤ g ≤ n − 5 , and g-good neighbor diagnosability of F C Q n under the PMC model and MM ⁎ model, i.e., t g ( F C Q n ) = ( n + 2 − g ) 2 g − 1 . Diagnosability PMC model Folded crossed cube Zhou, Shuming verfasserin (orcid)0000-0002-2114-7162 aut Zhang, Hong verfasserin aut Zhang, Qifan verfasserin aut Enthalten in Theoretical computer science Amsterdam [u.a.] : Elsevier, 1975 959 Online-Ressource (DE-627)265784174 (DE-600)1466347-8 (DE-576)074891030 nnns volume:959 GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4393 GBV_ILN_4700 54.10 Theoretische Informatik VZ AR 959 |
language |
English |
source |
Enthalten in Theoretical computer science 959 volume:959 |
sourceStr |
Enthalten in Theoretical computer science 959 volume:959 |
format_phy_str_mv |
Article |
bklname |
Theoretische Informatik |
institution |
findex.gbv.de |
topic_facet |
Diagnosability PMC model Folded crossed cube |
dewey-raw |
004 |
isfreeaccess_bool |
false |
container_title |
Theoretical computer science |
authorswithroles_txt_mv |
Niu, Baohua @@aut@@ Zhou, Shuming @@aut@@ Zhang, Hong @@aut@@ Zhang, Qifan @@aut@@ |
publishDateDaySort_date |
2023-01-01T00:00:00Z |
hierarchy_top_id |
265784174 |
dewey-sort |
14 |
id |
ELV065264770 |
language_de |
englisch |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV065264770</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20231027093050.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">231026s2023 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.tcs.2023.113858</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV065264770</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0304-3975(23)00171-8</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.10</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Niu, Baohua</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Fault tolerability analysis of folded crossed cubes based on</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2023</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">As data center networks and network-on-chip are developing rapidly, many graph invariants have been proposed to measure the reliability and fault tolerance of the network so that the multiprocessor systems can be ensured to operate efficiently and smoothly. The g-component connectivity of a graph G, denoted by c κ g ( G ) , is the minimum size of vertex cut such that G has at least g components. The g-good neighbor connectivity of a graph G, represented by κ g ( G ) , is the minimum size of vertex cut such that each vertex has at least g fault-free neighbors. Motivated by the conditional connectivities above, the g-component diagnosability ( c t g ( G ) ) and g-good neighbor diagnosability ( t g ( G ) ) of graph G have been suggested to evaluate the fault diagnostic capability of multiprocessor systems successively. In this paper, we determine the ( g + 1 ) -component connectivity of folded crossed cubes F C Q n , i.e., c κ g + 1 ( F C Q n ) = n g − g 2 2 + g 2 + 1 for 1 ≤ g ≤ ⌊ n 2 ⌋ , and ( g + 1 ) -component diagnosability of F C Q n under the PMC model and MM ⁎ model, i.e., c t g + 1 ( F C Q n ) = n g + n − g 2 2 − g 2 + 1 . Moreover, we establish the g-good neighbor connectivity of F C Q n , i.e., κ g ( F C Q n ) = ( n + 1 − g ) 2 g for 0 ≤ g ≤ n − 5 , and g-good neighbor diagnosability of F C Q n under the PMC model and MM ⁎ model, i.e., t g ( F C Q n ) = ( n + 2 − g ) 2 g − 1 .</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Diagnosability</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">PMC model</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Folded crossed cube</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhou, Shuming</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-2114-7162</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Hong</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Qifan</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Theoretical computer science</subfield><subfield code="d">Amsterdam [u.a.] : Elsevier, 1975</subfield><subfield code="g">959</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)265784174</subfield><subfield code="w">(DE-600)1466347-8</subfield><subfield code="w">(DE-576)074891030</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:959</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_101</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_150</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_187</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2001</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2026</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2106</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2232</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2470</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.10</subfield><subfield code="j">Theoretische Informatik</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">959</subfield></datafield></record></collection>
|
author |
Niu, Baohua |
spellingShingle |
Niu, Baohua ddc 004 bkl 54.10 misc Diagnosability misc PMC model misc Folded crossed cube Fault tolerability analysis of folded crossed cubes based on |
authorStr |
Niu, Baohua |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)265784174 |
format |
electronic Article |
dewey-ones |
004 - Data processing & computer science |
delete_txt_mv |
keep |
author_role |
aut aut aut aut |
collection |
elsevier |
remote_str |
true |
illustrated |
Not Illustrated |
topic_title |
004 VZ 54.10 bkl Fault tolerability analysis of folded crossed cubes based on Diagnosability PMC model Folded crossed cube |
topic |
ddc 004 bkl 54.10 misc Diagnosability misc PMC model misc Folded crossed cube |
topic_unstemmed |
ddc 004 bkl 54.10 misc Diagnosability misc PMC model misc Folded crossed cube |
topic_browse |
ddc 004 bkl 54.10 misc Diagnosability misc PMC model misc Folded crossed cube |
format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
cr |
hierarchy_parent_title |
Theoretical computer science |
hierarchy_parent_id |
265784174 |
dewey-tens |
000 - Computer science, knowledge & systems |
hierarchy_top_title |
Theoretical computer science |
isfreeaccess_txt |
false |
familylinks_str_mv |
(DE-627)265784174 (DE-600)1466347-8 (DE-576)074891030 |
title |
Fault tolerability analysis of folded crossed cubes based on |
ctrlnum |
(DE-627)ELV065264770 (ELSEVIER)S0304-3975(23)00171-8 |
title_full |
Fault tolerability analysis of folded crossed cubes based on |
author_sort |
Niu, Baohua |
journal |
Theoretical computer science |
journalStr |
Theoretical computer science |
lang_code |
eng |
isOA_bool |
false |
dewey-hundreds |
000 - Computer science, information & general works |
recordtype |
marc |
publishDateSort |
2023 |
contenttype_str_mv |
zzz |
author_browse |
Niu, Baohua Zhou, Shuming Zhang, Hong Zhang, Qifan |
container_volume |
959 |
class |
004 VZ 54.10 bkl |
format_se |
Elektronische Aufsätze |
author-letter |
Niu, Baohua |
doi_str_mv |
10.1016/j.tcs.2023.113858 |
normlink |
(ORCID)0000-0002-2114-7162 |
normlink_prefix_str_mv |
(orcid)0000-0002-2114-7162 |
dewey-full |
004 |
author2-role |
verfasserin |
title_sort |
fault tolerability analysis of folded crossed cubes based on |
title_auth |
Fault tolerability analysis of folded crossed cubes based on |
abstract |
As data center networks and network-on-chip are developing rapidly, many graph invariants have been proposed to measure the reliability and fault tolerance of the network so that the multiprocessor systems can be ensured to operate efficiently and smoothly. The g-component connectivity of a graph G, denoted by c κ g ( G ) , is the minimum size of vertex cut such that G has at least g components. The g-good neighbor connectivity of a graph G, represented by κ g ( G ) , is the minimum size of vertex cut such that each vertex has at least g fault-free neighbors. Motivated by the conditional connectivities above, the g-component diagnosability ( c t g ( G ) ) and g-good neighbor diagnosability ( t g ( G ) ) of graph G have been suggested to evaluate the fault diagnostic capability of multiprocessor systems successively. In this paper, we determine the ( g + 1 ) -component connectivity of folded crossed cubes F C Q n , i.e., c κ g + 1 ( F C Q n ) = n g − g 2 2 + g 2 + 1 for 1 ≤ g ≤ ⌊ n 2 ⌋ , and ( g + 1 ) -component diagnosability of F C Q n under the PMC model and MM ⁎ model, i.e., c t g + 1 ( F C Q n ) = n g + n − g 2 2 − g 2 + 1 . Moreover, we establish the g-good neighbor connectivity of F C Q n , i.e., κ g ( F C Q n ) = ( n + 1 − g ) 2 g for 0 ≤ g ≤ n − 5 , and g-good neighbor diagnosability of F C Q n under the PMC model and MM ⁎ model, i.e., t g ( F C Q n ) = ( n + 2 − g ) 2 g − 1 . |
abstractGer |
As data center networks and network-on-chip are developing rapidly, many graph invariants have been proposed to measure the reliability and fault tolerance of the network so that the multiprocessor systems can be ensured to operate efficiently and smoothly. The g-component connectivity of a graph G, denoted by c κ g ( G ) , is the minimum size of vertex cut such that G has at least g components. The g-good neighbor connectivity of a graph G, represented by κ g ( G ) , is the minimum size of vertex cut such that each vertex has at least g fault-free neighbors. Motivated by the conditional connectivities above, the g-component diagnosability ( c t g ( G ) ) and g-good neighbor diagnosability ( t g ( G ) ) of graph G have been suggested to evaluate the fault diagnostic capability of multiprocessor systems successively. In this paper, we determine the ( g + 1 ) -component connectivity of folded crossed cubes F C Q n , i.e., c κ g + 1 ( F C Q n ) = n g − g 2 2 + g 2 + 1 for 1 ≤ g ≤ ⌊ n 2 ⌋ , and ( g + 1 ) -component diagnosability of F C Q n under the PMC model and MM ⁎ model, i.e., c t g + 1 ( F C Q n ) = n g + n − g 2 2 − g 2 + 1 . Moreover, we establish the g-good neighbor connectivity of F C Q n , i.e., κ g ( F C Q n ) = ( n + 1 − g ) 2 g for 0 ≤ g ≤ n − 5 , and g-good neighbor diagnosability of F C Q n under the PMC model and MM ⁎ model, i.e., t g ( F C Q n ) = ( n + 2 − g ) 2 g − 1 . |
abstract_unstemmed |
As data center networks and network-on-chip are developing rapidly, many graph invariants have been proposed to measure the reliability and fault tolerance of the network so that the multiprocessor systems can be ensured to operate efficiently and smoothly. The g-component connectivity of a graph G, denoted by c κ g ( G ) , is the minimum size of vertex cut such that G has at least g components. The g-good neighbor connectivity of a graph G, represented by κ g ( G ) , is the minimum size of vertex cut such that each vertex has at least g fault-free neighbors. Motivated by the conditional connectivities above, the g-component diagnosability ( c t g ( G ) ) and g-good neighbor diagnosability ( t g ( G ) ) of graph G have been suggested to evaluate the fault diagnostic capability of multiprocessor systems successively. In this paper, we determine the ( g + 1 ) -component connectivity of folded crossed cubes F C Q n , i.e., c κ g + 1 ( F C Q n ) = n g − g 2 2 + g 2 + 1 for 1 ≤ g ≤ ⌊ n 2 ⌋ , and ( g + 1 ) -component diagnosability of F C Q n under the PMC model and MM ⁎ model, i.e., c t g + 1 ( F C Q n ) = n g + n − g 2 2 − g 2 + 1 . Moreover, we establish the g-good neighbor connectivity of F C Q n , i.e., κ g ( F C Q n ) = ( n + 1 − g ) 2 g for 0 ≤ g ≤ n − 5 , and g-good neighbor diagnosability of F C Q n under the PMC model and MM ⁎ model, i.e., t g ( F C Q n ) = ( n + 2 − g ) 2 g − 1 . |
collection_details |
GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4393 GBV_ILN_4700 |
title_short |
Fault tolerability analysis of folded crossed cubes based on |
remote_bool |
true |
author2 |
Zhou, Shuming Zhang, Hong Zhang, Qifan |
author2Str |
Zhou, Shuming Zhang, Hong Zhang, Qifan |
ppnlink |
265784174 |
mediatype_str_mv |
c |
isOA_txt |
false |
hochschulschrift_bool |
false |
doi_str |
10.1016/j.tcs.2023.113858 |
up_date |
2024-07-06T22:25:22.598Z |
_version_ |
1803870244805017600 |
fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV065264770</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20231027093050.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">231026s2023 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.tcs.2023.113858</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV065264770</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0304-3975(23)00171-8</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.10</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Niu, Baohua</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Fault tolerability analysis of folded crossed cubes based on</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2023</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">As data center networks and network-on-chip are developing rapidly, many graph invariants have been proposed to measure the reliability and fault tolerance of the network so that the multiprocessor systems can be ensured to operate efficiently and smoothly. The g-component connectivity of a graph G, denoted by c κ g ( G ) , is the minimum size of vertex cut such that G has at least g components. The g-good neighbor connectivity of a graph G, represented by κ g ( G ) , is the minimum size of vertex cut such that each vertex has at least g fault-free neighbors. Motivated by the conditional connectivities above, the g-component diagnosability ( c t g ( G ) ) and g-good neighbor diagnosability ( t g ( G ) ) of graph G have been suggested to evaluate the fault diagnostic capability of multiprocessor systems successively. In this paper, we determine the ( g + 1 ) -component connectivity of folded crossed cubes F C Q n , i.e., c κ g + 1 ( F C Q n ) = n g − g 2 2 + g 2 + 1 for 1 ≤ g ≤ ⌊ n 2 ⌋ , and ( g + 1 ) -component diagnosability of F C Q n under the PMC model and MM ⁎ model, i.e., c t g + 1 ( F C Q n ) = n g + n − g 2 2 − g 2 + 1 . Moreover, we establish the g-good neighbor connectivity of F C Q n , i.e., κ g ( F C Q n ) = ( n + 1 − g ) 2 g for 0 ≤ g ≤ n − 5 , and g-good neighbor diagnosability of F C Q n under the PMC model and MM ⁎ model, i.e., t g ( F C Q n ) = ( n + 2 − g ) 2 g − 1 .</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Diagnosability</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">PMC model</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Folded crossed cube</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhou, Shuming</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-2114-7162</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Hong</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Qifan</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Theoretical computer science</subfield><subfield code="d">Amsterdam [u.a.] : Elsevier, 1975</subfield><subfield code="g">959</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)265784174</subfield><subfield code="w">(DE-600)1466347-8</subfield><subfield code="w">(DE-576)074891030</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:959</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_101</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_150</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_187</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2001</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2026</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2106</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2232</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2470</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.10</subfield><subfield code="j">Theoretische Informatik</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">959</subfield></datafield></record></collection>
|
score |
7.3984118 |