Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity
The interconnection networks are generally modeled by a connected graph G, and the connectivity of G is an important parameter for reliability and fault tolerance of the network. A connected graph G = ( V , E ) is maximally edge-connected (or maximally-λ for short) if its edge-connectivity attains i...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Sun, Gaoxing [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2019transfer abstract |
|---|
| Schlagwörter: |
|---|
| Umfang: |
8 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries - Schweiss, Rüdiger ELSEVIER, 2015transfer abstract, the journal of the EATCS, Amsterdam [u.a.] |
|---|---|
| Übergeordnetes Werk: |
volume:758 ; year:2019 ; day:1 ; month:02 ; pages:9-16 ; extent:8 |
| Links: |
|---|
| DOI / URN: |
10.1016/j.tcs.2018.07.020 |
|---|
| Katalog-ID: |
ELV04538861X |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | ELV04538861X | ||
| 003 | DE-627 | ||
| 005 | 20230626011319.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 190205s2019 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1016/j.tcs.2018.07.020 |2 doi | |
| 028 | 5 | 2 | |a GBV00000000000484.pica |
| 035 | |a (DE-627)ELV04538861X | ||
| 035 | |a (ELSEVIER)S0304-3975(18)30503-6 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 620 |q VZ |
| 082 | 0 | 4 | |a 690 |q VZ |
| 084 | |a 50.92 |2 bkl | ||
| 100 | 1 | |a Sun, Gaoxing |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity |
| 264 | 1 | |c 2019transfer abstract | |
| 300 | |a 8 | ||
| 336 | |a nicht spezifiziert |b zzz |2 rdacontent | ||
| 337 | |a nicht spezifiziert |b z |2 rdamedia | ||
| 338 | |a nicht spezifiziert |b zu |2 rdacarrier | ||
| 520 | |a The interconnection networks are generally modeled by a connected graph G, and the connectivity of G is an important parameter for reliability and fault tolerance of the network. A connected graph G = ( V , E ) is maximally edge-connected (or maximally-λ for short) if its edge-connectivity attains its minimum degree. We define a maximally-λ graph G to be m-maximally-λ if G − S is still maximally-λ for any edge subset S ⊆ E ( G ) with | S | ≤ m . The maximum integer of such m, denoted by m λ ( G ) , is said to be the edge fault tolerance of G with respect to the maximally-λ property. In this paper, we discuss the edge fault tolerance for maximally-λ property of two families of interconnection networks, from which we determine the exact values of m λ ( G ) for some well-known networks. | ||
| 520 | |a The interconnection networks are generally modeled by a connected graph G, and the connectivity of G is an important parameter for reliability and fault tolerance of the network. A connected graph G = ( V , E ) is maximally edge-connected (or maximally-λ for short) if its edge-connectivity attains its minimum degree. We define a maximally-λ graph G to be m-maximally-λ if G − S is still maximally-λ for any edge subset S ⊆ E ( G ) with | S | ≤ m . The maximum integer of such m, denoted by m λ ( G ) , is said to be the edge fault tolerance of G with respect to the maximally-λ property. In this paper, we discuss the edge fault tolerance for maximally-λ property of two families of interconnection networks, from which we determine the exact values of m λ ( G ) for some well-known networks. | ||
| 650 | 7 | |a Maximally edge-connectivity |2 Elsevier | |
| 650 | 7 | |a Edge fault tolerance |2 Elsevier | |
| 650 | 7 | |a Interconnection networks |2 Elsevier | |
| 700 | 1 | |a Zhao, Shuang |4 oth | |
| 700 | 1 | |a Meng, Jixiang |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |n Elsevier |a Schweiss, Rüdiger ELSEVIER |t Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries |d 2015transfer abstract |d the journal of the EATCS |g Amsterdam [u.a.] |w (DE-627)ELV013125583 |
| 773 | 1 | 8 | |g volume:758 |g year:2019 |g day:1 |g month:02 |g pages:9-16 |g extent:8 |
| 856 | 4 | 0 | |u https://doi.org/10.1016/j.tcs.2018.07.020 |3 Volltext |
| 912 | |a GBV_USEFLAG_U | ||
| 912 | |a GBV_ELV | ||
| 912 | |a SYSFLAG_U | ||
| 912 | |a GBV_ILN_22 | ||
| 912 | |a GBV_ILN_40 | ||
| 936 | b | k | |a 50.92 |j Meerestechnik |q VZ |
| 951 | |a AR | ||
| 952 | |d 758 |j 2019 |b 1 |c 0201 |h 9-16 |g 8 | ||
| author_variant |
g s gs |
|---|---|
| matchkey_str |
sungaoxingzhaoshuangmengjixiang:2019----:dealtlrnefnecnetontokwtrsetoai |
| hierarchy_sort_str |
2019transfer abstract |
| bklnumber |
50.92 |
| publishDate |
2019 |
| allfields |
10.1016/j.tcs.2018.07.020 doi GBV00000000000484.pica (DE-627)ELV04538861X (ELSEVIER)S0304-3975(18)30503-6 DE-627 ger DE-627 rakwb eng 620 VZ 690 VZ 50.92 bkl Sun, Gaoxing verfasserin aut Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity 2019transfer abstract 8 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier The interconnection networks are generally modeled by a connected graph G, and the connectivity of G is an important parameter for reliability and fault tolerance of the network. A connected graph G = ( V , E ) is maximally edge-connected (or maximally-λ for short) if its edge-connectivity attains its minimum degree. We define a maximally-λ graph G to be m-maximally-λ if G − S is still maximally-λ for any edge subset S ⊆ E ( G ) with | S | ≤ m . The maximum integer of such m, denoted by m λ ( G ) , is said to be the edge fault tolerance of G with respect to the maximally-λ property. In this paper, we discuss the edge fault tolerance for maximally-λ property of two families of interconnection networks, from which we determine the exact values of m λ ( G ) for some well-known networks. The interconnection networks are generally modeled by a connected graph G, and the connectivity of G is an important parameter for reliability and fault tolerance of the network. A connected graph G = ( V , E ) is maximally edge-connected (or maximally-λ for short) if its edge-connectivity attains its minimum degree. We define a maximally-λ graph G to be m-maximally-λ if G − S is still maximally-λ for any edge subset S ⊆ E ( G ) with | S | ≤ m . The maximum integer of such m, denoted by m λ ( G ) , is said to be the edge fault tolerance of G with respect to the maximally-λ property. In this paper, we discuss the edge fault tolerance for maximally-λ property of two families of interconnection networks, from which we determine the exact values of m λ ( G ) for some well-known networks. Maximally edge-connectivity Elsevier Edge fault tolerance Elsevier Interconnection networks Elsevier Zhao, Shuang oth Meng, Jixiang oth Enthalten in Elsevier Schweiss, Rüdiger ELSEVIER Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries 2015transfer abstract the journal of the EATCS Amsterdam [u.a.] (DE-627)ELV013125583 volume:758 year:2019 day:1 month:02 pages:9-16 extent:8 https://doi.org/10.1016/j.tcs.2018.07.020 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 50.92 Meerestechnik VZ AR 758 2019 1 0201 9-16 8 |
| spelling |
10.1016/j.tcs.2018.07.020 doi GBV00000000000484.pica (DE-627)ELV04538861X (ELSEVIER)S0304-3975(18)30503-6 DE-627 ger DE-627 rakwb eng 620 VZ 690 VZ 50.92 bkl Sun, Gaoxing verfasserin aut Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity 2019transfer abstract 8 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier The interconnection networks are generally modeled by a connected graph G, and the connectivity of G is an important parameter for reliability and fault tolerance of the network. A connected graph G = ( V , E ) is maximally edge-connected (or maximally-λ for short) if its edge-connectivity attains its minimum degree. We define a maximally-λ graph G to be m-maximally-λ if G − S is still maximally-λ for any edge subset S ⊆ E ( G ) with | S | ≤ m . The maximum integer of such m, denoted by m λ ( G ) , is said to be the edge fault tolerance of G with respect to the maximally-λ property. In this paper, we discuss the edge fault tolerance for maximally-λ property of two families of interconnection networks, from which we determine the exact values of m λ ( G ) for some well-known networks. The interconnection networks are generally modeled by a connected graph G, and the connectivity of G is an important parameter for reliability and fault tolerance of the network. A connected graph G = ( V , E ) is maximally edge-connected (or maximally-λ for short) if its edge-connectivity attains its minimum degree. We define a maximally-λ graph G to be m-maximally-λ if G − S is still maximally-λ for any edge subset S ⊆ E ( G ) with | S | ≤ m . The maximum integer of such m, denoted by m λ ( G ) , is said to be the edge fault tolerance of G with respect to the maximally-λ property. In this paper, we discuss the edge fault tolerance for maximally-λ property of two families of interconnection networks, from which we determine the exact values of m λ ( G ) for some well-known networks. Maximally edge-connectivity Elsevier Edge fault tolerance Elsevier Interconnection networks Elsevier Zhao, Shuang oth Meng, Jixiang oth Enthalten in Elsevier Schweiss, Rüdiger ELSEVIER Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries 2015transfer abstract the journal of the EATCS Amsterdam [u.a.] (DE-627)ELV013125583 volume:758 year:2019 day:1 month:02 pages:9-16 extent:8 https://doi.org/10.1016/j.tcs.2018.07.020 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 50.92 Meerestechnik VZ AR 758 2019 1 0201 9-16 8 |
| allfields_unstemmed |
10.1016/j.tcs.2018.07.020 doi GBV00000000000484.pica (DE-627)ELV04538861X (ELSEVIER)S0304-3975(18)30503-6 DE-627 ger DE-627 rakwb eng 620 VZ 690 VZ 50.92 bkl Sun, Gaoxing verfasserin aut Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity 2019transfer abstract 8 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier The interconnection networks are generally modeled by a connected graph G, and the connectivity of G is an important parameter for reliability and fault tolerance of the network. A connected graph G = ( V , E ) is maximally edge-connected (or maximally-λ for short) if its edge-connectivity attains its minimum degree. We define a maximally-λ graph G to be m-maximally-λ if G − S is still maximally-λ for any edge subset S ⊆ E ( G ) with | S | ≤ m . The maximum integer of such m, denoted by m λ ( G ) , is said to be the edge fault tolerance of G with respect to the maximally-λ property. In this paper, we discuss the edge fault tolerance for maximally-λ property of two families of interconnection networks, from which we determine the exact values of m λ ( G ) for some well-known networks. The interconnection networks are generally modeled by a connected graph G, and the connectivity of G is an important parameter for reliability and fault tolerance of the network. A connected graph G = ( V , E ) is maximally edge-connected (or maximally-λ for short) if its edge-connectivity attains its minimum degree. We define a maximally-λ graph G to be m-maximally-λ if G − S is still maximally-λ for any edge subset S ⊆ E ( G ) with | S | ≤ m . The maximum integer of such m, denoted by m λ ( G ) , is said to be the edge fault tolerance of G with respect to the maximally-λ property. In this paper, we discuss the edge fault tolerance for maximally-λ property of two families of interconnection networks, from which we determine the exact values of m λ ( G ) for some well-known networks. Maximally edge-connectivity Elsevier Edge fault tolerance Elsevier Interconnection networks Elsevier Zhao, Shuang oth Meng, Jixiang oth Enthalten in Elsevier Schweiss, Rüdiger ELSEVIER Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries 2015transfer abstract the journal of the EATCS Amsterdam [u.a.] (DE-627)ELV013125583 volume:758 year:2019 day:1 month:02 pages:9-16 extent:8 https://doi.org/10.1016/j.tcs.2018.07.020 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 50.92 Meerestechnik VZ AR 758 2019 1 0201 9-16 8 |
| allfieldsGer |
10.1016/j.tcs.2018.07.020 doi GBV00000000000484.pica (DE-627)ELV04538861X (ELSEVIER)S0304-3975(18)30503-6 DE-627 ger DE-627 rakwb eng 620 VZ 690 VZ 50.92 bkl Sun, Gaoxing verfasserin aut Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity 2019transfer abstract 8 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier The interconnection networks are generally modeled by a connected graph G, and the connectivity of G is an important parameter for reliability and fault tolerance of the network. A connected graph G = ( V , E ) is maximally edge-connected (or maximally-λ for short) if its edge-connectivity attains its minimum degree. We define a maximally-λ graph G to be m-maximally-λ if G − S is still maximally-λ for any edge subset S ⊆ E ( G ) with | S | ≤ m . The maximum integer of such m, denoted by m λ ( G ) , is said to be the edge fault tolerance of G with respect to the maximally-λ property. In this paper, we discuss the edge fault tolerance for maximally-λ property of two families of interconnection networks, from which we determine the exact values of m λ ( G ) for some well-known networks. The interconnection networks are generally modeled by a connected graph G, and the connectivity of G is an important parameter for reliability and fault tolerance of the network. A connected graph G = ( V , E ) is maximally edge-connected (or maximally-λ for short) if its edge-connectivity attains its minimum degree. We define a maximally-λ graph G to be m-maximally-λ if G − S is still maximally-λ for any edge subset S ⊆ E ( G ) with | S | ≤ m . The maximum integer of such m, denoted by m λ ( G ) , is said to be the edge fault tolerance of G with respect to the maximally-λ property. In this paper, we discuss the edge fault tolerance for maximally-λ property of two families of interconnection networks, from which we determine the exact values of m λ ( G ) for some well-known networks. Maximally edge-connectivity Elsevier Edge fault tolerance Elsevier Interconnection networks Elsevier Zhao, Shuang oth Meng, Jixiang oth Enthalten in Elsevier Schweiss, Rüdiger ELSEVIER Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries 2015transfer abstract the journal of the EATCS Amsterdam [u.a.] (DE-627)ELV013125583 volume:758 year:2019 day:1 month:02 pages:9-16 extent:8 https://doi.org/10.1016/j.tcs.2018.07.020 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 50.92 Meerestechnik VZ AR 758 2019 1 0201 9-16 8 |
| allfieldsSound |
10.1016/j.tcs.2018.07.020 doi GBV00000000000484.pica (DE-627)ELV04538861X (ELSEVIER)S0304-3975(18)30503-6 DE-627 ger DE-627 rakwb eng 620 VZ 690 VZ 50.92 bkl Sun, Gaoxing verfasserin aut Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity 2019transfer abstract 8 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier The interconnection networks are generally modeled by a connected graph G, and the connectivity of G is an important parameter for reliability and fault tolerance of the network. A connected graph G = ( V , E ) is maximally edge-connected (or maximally-λ for short) if its edge-connectivity attains its minimum degree. We define a maximally-λ graph G to be m-maximally-λ if G − S is still maximally-λ for any edge subset S ⊆ E ( G ) with | S | ≤ m . The maximum integer of such m, denoted by m λ ( G ) , is said to be the edge fault tolerance of G with respect to the maximally-λ property. In this paper, we discuss the edge fault tolerance for maximally-λ property of two families of interconnection networks, from which we determine the exact values of m λ ( G ) for some well-known networks. The interconnection networks are generally modeled by a connected graph G, and the connectivity of G is an important parameter for reliability and fault tolerance of the network. A connected graph G = ( V , E ) is maximally edge-connected (or maximally-λ for short) if its edge-connectivity attains its minimum degree. We define a maximally-λ graph G to be m-maximally-λ if G − S is still maximally-λ for any edge subset S ⊆ E ( G ) with | S | ≤ m . The maximum integer of such m, denoted by m λ ( G ) , is said to be the edge fault tolerance of G with respect to the maximally-λ property. In this paper, we discuss the edge fault tolerance for maximally-λ property of two families of interconnection networks, from which we determine the exact values of m λ ( G ) for some well-known networks. Maximally edge-connectivity Elsevier Edge fault tolerance Elsevier Interconnection networks Elsevier Zhao, Shuang oth Meng, Jixiang oth Enthalten in Elsevier Schweiss, Rüdiger ELSEVIER Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries 2015transfer abstract the journal of the EATCS Amsterdam [u.a.] (DE-627)ELV013125583 volume:758 year:2019 day:1 month:02 pages:9-16 extent:8 https://doi.org/10.1016/j.tcs.2018.07.020 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 50.92 Meerestechnik VZ AR 758 2019 1 0201 9-16 8 |
| language |
English |
| source |
Enthalten in Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries Amsterdam [u.a.] volume:758 year:2019 day:1 month:02 pages:9-16 extent:8 |
| sourceStr |
Enthalten in Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries Amsterdam [u.a.] volume:758 year:2019 day:1 month:02 pages:9-16 extent:8 |
| format_phy_str_mv |
Article |
| bklname |
Meerestechnik |
| institution |
findex.gbv.de |
| topic_facet |
Maximally edge-connectivity Edge fault tolerance Interconnection networks |
| dewey-raw |
620 |
| isfreeaccess_bool |
false |
| container_title |
Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries |
| authorswithroles_txt_mv |
Sun, Gaoxing @@aut@@ Zhao, Shuang @@oth@@ Meng, Jixiang @@oth@@ |
| publishDateDaySort_date |
2019-01-01T00:00:00Z |
| hierarchy_top_id |
ELV013125583 |
| dewey-sort |
3620 |
| id |
ELV04538861X |
| 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">ELV04538861X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230626011319.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">190205s2019 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.tcs.2018.07.020</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBV00000000000484.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV04538861X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0304-3975(18)30503-6</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">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">690</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">50.92</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sun, Gaoxing</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">8</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">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The interconnection networks are generally modeled by a connected graph G, and the connectivity of G is an important parameter for reliability and fault tolerance of the network. A connected graph G = ( V , E ) is maximally edge-connected (or maximally-λ for short) if its edge-connectivity attains its minimum degree. We define a maximally-λ graph G to be m-maximally-λ if G − S is still maximally-λ for any edge subset S ⊆ E ( G ) with | S | ≤ m . The maximum integer of such m, denoted by m λ ( G ) , is said to be the edge fault tolerance of G with respect to the maximally-λ property. In this paper, we discuss the edge fault tolerance for maximally-λ property of two families of interconnection networks, from which we determine the exact values of m λ ( G ) for some well-known networks.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The interconnection networks are generally modeled by a connected graph G, and the connectivity of G is an important parameter for reliability and fault tolerance of the network. A connected graph G = ( V , E ) is maximally edge-connected (or maximally-λ for short) if its edge-connectivity attains its minimum degree. We define a maximally-λ graph G to be m-maximally-λ if G − S is still maximally-λ for any edge subset S ⊆ E ( G ) with | S | ≤ m . The maximum integer of such m, denoted by m λ ( G ) , is said to be the edge fault tolerance of G with respect to the maximally-λ property. In this paper, we discuss the edge fault tolerance for maximally-λ property of two families of interconnection networks, from which we determine the exact values of m λ ( G ) for some well-known networks.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Maximally edge-connectivity</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Edge fault tolerance</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Interconnection networks</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhao, Shuang</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Meng, Jixiang</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Elsevier</subfield><subfield code="a">Schweiss, Rüdiger ELSEVIER</subfield><subfield code="t">Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries</subfield><subfield code="d">2015transfer abstract</subfield><subfield code="d">the journal of the EATCS</subfield><subfield code="g">Amsterdam [u.a.]</subfield><subfield code="w">(DE-627)ELV013125583</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:758</subfield><subfield code="g">year:2019</subfield><subfield code="g">day:1</subfield><subfield code="g">month:02</subfield><subfield code="g">pages:9-16</subfield><subfield code="g">extent:8</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.tcs.2018.07.020</subfield><subfield code="3">Volltext</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_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">50.92</subfield><subfield code="j">Meerestechnik</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">758</subfield><subfield code="j">2019</subfield><subfield code="b">1</subfield><subfield code="c">0201</subfield><subfield code="h">9-16</subfield><subfield code="g">8</subfield></datafield></record></collection>
|
| author |
Sun, Gaoxing |
| spellingShingle |
Sun, Gaoxing ddc 620 ddc 690 bkl 50.92 Elsevier Maximally edge-connectivity Elsevier Edge fault tolerance Elsevier Interconnection networks Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity |
| authorStr |
Sun, Gaoxing |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)ELV013125583 |
| format |
electronic Article |
| dewey-ones |
620 - Engineering & allied operations 690 - Buildings |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
elsevier |
| remote_str |
true |
| illustrated |
Not Illustrated |
| topic_title |
620 VZ 690 VZ 50.92 bkl Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity Maximally edge-connectivity Elsevier Edge fault tolerance Elsevier Interconnection networks Elsevier |
| topic |
ddc 620 ddc 690 bkl 50.92 Elsevier Maximally edge-connectivity Elsevier Edge fault tolerance Elsevier Interconnection networks |
| topic_unstemmed |
ddc 620 ddc 690 bkl 50.92 Elsevier Maximally edge-connectivity Elsevier Edge fault tolerance Elsevier Interconnection networks |
| topic_browse |
ddc 620 ddc 690 bkl 50.92 Elsevier Maximally edge-connectivity Elsevier Edge fault tolerance Elsevier Interconnection networks |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
zu |
| author2_variant |
s z sz j m jm |
| hierarchy_parent_title |
Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries |
| hierarchy_parent_id |
ELV013125583 |
| dewey-tens |
620 - Engineering 690 - Building & construction |
| hierarchy_top_title |
Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)ELV013125583 |
| title |
Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity |
| ctrlnum |
(DE-627)ELV04538861X (ELSEVIER)S0304-3975(18)30503-6 |
| title_full |
Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity |
| author_sort |
Sun, Gaoxing |
| journal |
Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries |
| journalStr |
Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
600 - Technology |
| recordtype |
marc |
| publishDateSort |
2019 |
| contenttype_str_mv |
zzz |
| container_start_page |
9 |
| author_browse |
Sun, Gaoxing |
| container_volume |
758 |
| physical |
8 |
| class |
620 VZ 690 VZ 50.92 bkl |
| format_se |
Elektronische Aufsätze |
| author-letter |
Sun, Gaoxing |
| doi_str_mv |
10.1016/j.tcs.2018.07.020 |
| dewey-full |
620 690 |
| title_sort |
edge fault tolerance of interconnection networks with respect to maximally edge-connectivity |
| title_auth |
Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity |
| abstract |
The interconnection networks are generally modeled by a connected graph G, and the connectivity of G is an important parameter for reliability and fault tolerance of the network. A connected graph G = ( V , E ) is maximally edge-connected (or maximally-λ for short) if its edge-connectivity attains its minimum degree. We define a maximally-λ graph G to be m-maximally-λ if G − S is still maximally-λ for any edge subset S ⊆ E ( G ) with | S | ≤ m . The maximum integer of such m, denoted by m λ ( G ) , is said to be the edge fault tolerance of G with respect to the maximally-λ property. In this paper, we discuss the edge fault tolerance for maximally-λ property of two families of interconnection networks, from which we determine the exact values of m λ ( G ) for some well-known networks. |
| abstractGer |
The interconnection networks are generally modeled by a connected graph G, and the connectivity of G is an important parameter for reliability and fault tolerance of the network. A connected graph G = ( V , E ) is maximally edge-connected (or maximally-λ for short) if its edge-connectivity attains its minimum degree. We define a maximally-λ graph G to be m-maximally-λ if G − S is still maximally-λ for any edge subset S ⊆ E ( G ) with | S | ≤ m . The maximum integer of such m, denoted by m λ ( G ) , is said to be the edge fault tolerance of G with respect to the maximally-λ property. In this paper, we discuss the edge fault tolerance for maximally-λ property of two families of interconnection networks, from which we determine the exact values of m λ ( G ) for some well-known networks. |
| abstract_unstemmed |
The interconnection networks are generally modeled by a connected graph G, and the connectivity of G is an important parameter for reliability and fault tolerance of the network. A connected graph G = ( V , E ) is maximally edge-connected (or maximally-λ for short) if its edge-connectivity attains its minimum degree. We define a maximally-λ graph G to be m-maximally-λ if G − S is still maximally-λ for any edge subset S ⊆ E ( G ) with | S | ≤ m . The maximum integer of such m, denoted by m λ ( G ) , is said to be the edge fault tolerance of G with respect to the maximally-λ property. In this paper, we discuss the edge fault tolerance for maximally-λ property of two families of interconnection networks, from which we determine the exact values of m λ ( G ) for some well-known networks. |
| collection_details |
GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 |
| title_short |
Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity |
| url |
https://doi.org/10.1016/j.tcs.2018.07.020 |
| remote_bool |
true |
| author2 |
Zhao, Shuang Meng, Jixiang |
| author2Str |
Zhao, Shuang Meng, Jixiang |
| ppnlink |
ELV013125583 |
| mediatype_str_mv |
z |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth oth |
| doi_str |
10.1016/j.tcs.2018.07.020 |
| up_date |
2024-07-06T17:23:48.231Z |
| _version_ |
1803851271484997632 |
| 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">ELV04538861X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230626011319.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">190205s2019 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.tcs.2018.07.020</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBV00000000000484.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV04538861X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0304-3975(18)30503-6</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">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">690</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">50.92</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sun, Gaoxing</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">8</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">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The interconnection networks are generally modeled by a connected graph G, and the connectivity of G is an important parameter for reliability and fault tolerance of the network. A connected graph G = ( V , E ) is maximally edge-connected (or maximally-λ for short) if its edge-connectivity attains its minimum degree. We define a maximally-λ graph G to be m-maximally-λ if G − S is still maximally-λ for any edge subset S ⊆ E ( G ) with | S | ≤ m . The maximum integer of such m, denoted by m λ ( G ) , is said to be the edge fault tolerance of G with respect to the maximally-λ property. In this paper, we discuss the edge fault tolerance for maximally-λ property of two families of interconnection networks, from which we determine the exact values of m λ ( G ) for some well-known networks.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The interconnection networks are generally modeled by a connected graph G, and the connectivity of G is an important parameter for reliability and fault tolerance of the network. A connected graph G = ( V , E ) is maximally edge-connected (or maximally-λ for short) if its edge-connectivity attains its minimum degree. We define a maximally-λ graph G to be m-maximally-λ if G − S is still maximally-λ for any edge subset S ⊆ E ( G ) with | S | ≤ m . The maximum integer of such m, denoted by m λ ( G ) , is said to be the edge fault tolerance of G with respect to the maximally-λ property. In this paper, we discuss the edge fault tolerance for maximally-λ property of two families of interconnection networks, from which we determine the exact values of m λ ( G ) for some well-known networks.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Maximally edge-connectivity</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Edge fault tolerance</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Interconnection networks</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhao, Shuang</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Meng, Jixiang</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Elsevier</subfield><subfield code="a">Schweiss, Rüdiger ELSEVIER</subfield><subfield code="t">Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries</subfield><subfield code="d">2015transfer abstract</subfield><subfield code="d">the journal of the EATCS</subfield><subfield code="g">Amsterdam [u.a.]</subfield><subfield code="w">(DE-627)ELV013125583</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:758</subfield><subfield code="g">year:2019</subfield><subfield code="g">day:1</subfield><subfield code="g">month:02</subfield><subfield code="g">pages:9-16</subfield><subfield code="g">extent:8</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.tcs.2018.07.020</subfield><subfield code="3">Volltext</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_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">50.92</subfield><subfield code="j">Meerestechnik</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">758</subfield><subfield code="j">2019</subfield><subfield code="b">1</subfield><subfield code="c">0201</subfield><subfield code="h">9-16</subfield><subfield code="g">8</subfield></datafield></record></collection>
|
| score |
7.4011145 |