Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs
Edge fault-tolerance of interconnection network is of significant important to the design and maintenance of multiprocessor systems. A connected graph G is maximally edge-connected (maximally-λ for short) if its edge-connectivity attains its minimum degree. G is super edge-connected (super-λ for sho...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Zhao, Shuang [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2021transfer abstract |
|---|
| Schlagwörter: |
|---|
| Umfang: |
9 |
|---|
| Übergeordnetes Werk: |
Enthalten in: 1190 poster EVALUATION OF DEFORMABLE IMAGE CO-REGISTRATION IN ADAPTIVE IMRT FOR HEAD AND NECK CANCER - 2011, JCSS, San Diego, Calif. [u.a.] |
|---|---|
| Übergeordnetes Werk: |
volume:115 ; year:2021 ; pages:64-72 ; extent:9 |
| Links: |
|---|
| DOI / URN: |
10.1016/j.jcss.2020.07.002 |
|---|
| Katalog-ID: |
ELV051659840 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | ELV051659840 | ||
| 003 | DE-627 | ||
| 005 | 20230626032304.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 210910s2021 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1016/j.jcss.2020.07.002 |2 doi | |
| 028 | 5 | 2 | |a /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001164.pica |
| 035 | |a (DE-627)ELV051659840 | ||
| 035 | |a (ELSEVIER)S0022-0000(20)30069-6 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 610 |q VZ |
| 082 | 0 | 4 | |a 570 |a 540 |q VZ |
| 100 | 1 | |a Zhao, Shuang |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs |
| 264 | 1 | |c 2021transfer abstract | |
| 300 | |a 9 | ||
| 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 Edge fault-tolerance of interconnection network is of significant important to the design and maintenance of multiprocessor systems. A connected graph G is maximally edge-connected (maximally-λ for short) if its edge-connectivity attains its minimum degree. G is super edge-connected (super-λ for short) if every minimum edge-cut isolates one vertex. The edge fault-tolerance of the maximally-λ (resp. super-λ) graph G with respect to the maximally-λ (resp. super-λ) property, denoted by m λ ( G ) (resp. S λ ( G ) ), is the maximum integer m for which G − S is still maximally-λ (resp. super-λ) for any edge subset S with | S | ≤ m . In this paper, we give upper and lower bounds on m λ ( G ) . Furthermore, we completely determine the exact values of m λ ( G ) and S λ ( G ) for vertex transitive graphs. | ||
| 520 | |a Edge fault-tolerance of interconnection network is of significant important to the design and maintenance of multiprocessor systems. A connected graph G is maximally edge-connected (maximally-λ for short) if its edge-connectivity attains its minimum degree. G is super edge-connected (super-λ for short) if every minimum edge-cut isolates one vertex. The edge fault-tolerance of the maximally-λ (resp. super-λ) graph G with respect to the maximally-λ (resp. super-λ) property, denoted by m λ ( G ) (resp. S λ ( G ) ), is the maximum integer m for which G − S is still maximally-λ (resp. super-λ) for any edge subset S with | S | ≤ m . In this paper, we give upper and lower bounds on m λ ( G ) . Furthermore, we completely determine the exact values of m λ ( G ) and S λ ( G ) for vertex transitive graphs. | ||
| 650 | 7 | |a Vertex transitive graph |2 Elsevier | |
| 650 | 7 | |a Super edge-connected |2 Elsevier | |
| 650 | 7 | |a Edge fault-tolerance |2 Elsevier | |
| 650 | 7 | |a Maximally edge-connected |2 Elsevier | |
| 700 | 1 | |a Chen, Zongqing |4 oth | |
| 700 | 1 | |a Yang, Weihua |4 oth | |
| 700 | 1 | |a Meng, Jixiang |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |n Elsevier |t 1190 poster EVALUATION OF DEFORMABLE IMAGE CO-REGISTRATION IN ADAPTIVE IMRT FOR HEAD AND NECK CANCER |d 2011 |d JCSS |g San Diego, Calif. [u.a.] |w (DE-627)ELV010661603 |
| 773 | 1 | 8 | |g volume:115 |g year:2021 |g pages:64-72 |g extent:9 |
| 856 | 4 | 0 | |u https://doi.org/10.1016/j.jcss.2020.07.002 |3 Volltext |
| 912 | |a GBV_USEFLAG_U | ||
| 912 | |a GBV_ELV | ||
| 912 | |a SYSFLAG_U | ||
| 912 | |a SSG-OLC-PHA | ||
| 912 | |a GBV_ILN_39 | ||
| 912 | |a GBV_ILN_62 | ||
| 912 | |a GBV_ILN_90 | ||
| 912 | |a GBV_ILN_120 | ||
| 912 | |a GBV_ILN_127 | ||
| 912 | |a GBV_ILN_227 | ||
| 912 | |a GBV_ILN_2001 | ||
| 912 | |a GBV_ILN_2005 | ||
| 912 | |a GBV_ILN_2007 | ||
| 912 | |a GBV_ILN_2008 | ||
| 912 | |a GBV_ILN_2011 | ||
| 912 | |a GBV_ILN_2015 | ||
| 912 | |a GBV_ILN_2018 | ||
| 912 | |a GBV_ILN_2094 | ||
| 951 | |a AR | ||
| 952 | |d 115 |j 2021 |h 64-72 |g 9 | ||
| author_variant |
s z sz |
|---|---|
| matchkey_str |
zhaoshuangchenzongqingyangweihuamengjixi:2021----:dealtlrnenlssfaialegcnetdrpsns |
| hierarchy_sort_str |
2021transfer abstract |
| publishDate |
2021 |
| allfields |
10.1016/j.jcss.2020.07.002 doi /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001164.pica (DE-627)ELV051659840 (ELSEVIER)S0022-0000(20)30069-6 DE-627 ger DE-627 rakwb eng 610 VZ 570 540 VZ Zhao, Shuang verfasserin aut Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs 2021transfer abstract 9 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Edge fault-tolerance of interconnection network is of significant important to the design and maintenance of multiprocessor systems. A connected graph G is maximally edge-connected (maximally-λ for short) if its edge-connectivity attains its minimum degree. G is super edge-connected (super-λ for short) if every minimum edge-cut isolates one vertex. The edge fault-tolerance of the maximally-λ (resp. super-λ) graph G with respect to the maximally-λ (resp. super-λ) property, denoted by m λ ( G ) (resp. S λ ( G ) ), is the maximum integer m for which G − S is still maximally-λ (resp. super-λ) for any edge subset S with | S | ≤ m . In this paper, we give upper and lower bounds on m λ ( G ) . Furthermore, we completely determine the exact values of m λ ( G ) and S λ ( G ) for vertex transitive graphs. Edge fault-tolerance of interconnection network is of significant important to the design and maintenance of multiprocessor systems. A connected graph G is maximally edge-connected (maximally-λ for short) if its edge-connectivity attains its minimum degree. G is super edge-connected (super-λ for short) if every minimum edge-cut isolates one vertex. The edge fault-tolerance of the maximally-λ (resp. super-λ) graph G with respect to the maximally-λ (resp. super-λ) property, denoted by m λ ( G ) (resp. S λ ( G ) ), is the maximum integer m for which G − S is still maximally-λ (resp. super-λ) for any edge subset S with | S | ≤ m . In this paper, we give upper and lower bounds on m λ ( G ) . Furthermore, we completely determine the exact values of m λ ( G ) and S λ ( G ) for vertex transitive graphs. Vertex transitive graph Elsevier Super edge-connected Elsevier Edge fault-tolerance Elsevier Maximally edge-connected Elsevier Chen, Zongqing oth Yang, Weihua oth Meng, Jixiang oth Enthalten in Elsevier 1190 poster EVALUATION OF DEFORMABLE IMAGE CO-REGISTRATION IN ADAPTIVE IMRT FOR HEAD AND NECK CANCER 2011 JCSS San Diego, Calif. [u.a.] (DE-627)ELV010661603 volume:115 year:2021 pages:64-72 extent:9 https://doi.org/10.1016/j.jcss.2020.07.002 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA GBV_ILN_39 GBV_ILN_62 GBV_ILN_90 GBV_ILN_120 GBV_ILN_127 GBV_ILN_227 GBV_ILN_2001 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2011 GBV_ILN_2015 GBV_ILN_2018 GBV_ILN_2094 AR 115 2021 64-72 9 |
| spelling |
10.1016/j.jcss.2020.07.002 doi /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001164.pica (DE-627)ELV051659840 (ELSEVIER)S0022-0000(20)30069-6 DE-627 ger DE-627 rakwb eng 610 VZ 570 540 VZ Zhao, Shuang verfasserin aut Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs 2021transfer abstract 9 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Edge fault-tolerance of interconnection network is of significant important to the design and maintenance of multiprocessor systems. A connected graph G is maximally edge-connected (maximally-λ for short) if its edge-connectivity attains its minimum degree. G is super edge-connected (super-λ for short) if every minimum edge-cut isolates one vertex. The edge fault-tolerance of the maximally-λ (resp. super-λ) graph G with respect to the maximally-λ (resp. super-λ) property, denoted by m λ ( G ) (resp. S λ ( G ) ), is the maximum integer m for which G − S is still maximally-λ (resp. super-λ) for any edge subset S with | S | ≤ m . In this paper, we give upper and lower bounds on m λ ( G ) . Furthermore, we completely determine the exact values of m λ ( G ) and S λ ( G ) for vertex transitive graphs. Edge fault-tolerance of interconnection network is of significant important to the design and maintenance of multiprocessor systems. A connected graph G is maximally edge-connected (maximally-λ for short) if its edge-connectivity attains its minimum degree. G is super edge-connected (super-λ for short) if every minimum edge-cut isolates one vertex. The edge fault-tolerance of the maximally-λ (resp. super-λ) graph G with respect to the maximally-λ (resp. super-λ) property, denoted by m λ ( G ) (resp. S λ ( G ) ), is the maximum integer m for which G − S is still maximally-λ (resp. super-λ) for any edge subset S with | S | ≤ m . In this paper, we give upper and lower bounds on m λ ( G ) . Furthermore, we completely determine the exact values of m λ ( G ) and S λ ( G ) for vertex transitive graphs. Vertex transitive graph Elsevier Super edge-connected Elsevier Edge fault-tolerance Elsevier Maximally edge-connected Elsevier Chen, Zongqing oth Yang, Weihua oth Meng, Jixiang oth Enthalten in Elsevier 1190 poster EVALUATION OF DEFORMABLE IMAGE CO-REGISTRATION IN ADAPTIVE IMRT FOR HEAD AND NECK CANCER 2011 JCSS San Diego, Calif. [u.a.] (DE-627)ELV010661603 volume:115 year:2021 pages:64-72 extent:9 https://doi.org/10.1016/j.jcss.2020.07.002 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA GBV_ILN_39 GBV_ILN_62 GBV_ILN_90 GBV_ILN_120 GBV_ILN_127 GBV_ILN_227 GBV_ILN_2001 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2011 GBV_ILN_2015 GBV_ILN_2018 GBV_ILN_2094 AR 115 2021 64-72 9 |
| allfields_unstemmed |
10.1016/j.jcss.2020.07.002 doi /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001164.pica (DE-627)ELV051659840 (ELSEVIER)S0022-0000(20)30069-6 DE-627 ger DE-627 rakwb eng 610 VZ 570 540 VZ Zhao, Shuang verfasserin aut Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs 2021transfer abstract 9 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Edge fault-tolerance of interconnection network is of significant important to the design and maintenance of multiprocessor systems. A connected graph G is maximally edge-connected (maximally-λ for short) if its edge-connectivity attains its minimum degree. G is super edge-connected (super-λ for short) if every minimum edge-cut isolates one vertex. The edge fault-tolerance of the maximally-λ (resp. super-λ) graph G with respect to the maximally-λ (resp. super-λ) property, denoted by m λ ( G ) (resp. S λ ( G ) ), is the maximum integer m for which G − S is still maximally-λ (resp. super-λ) for any edge subset S with | S | ≤ m . In this paper, we give upper and lower bounds on m λ ( G ) . Furthermore, we completely determine the exact values of m λ ( G ) and S λ ( G ) for vertex transitive graphs. Edge fault-tolerance of interconnection network is of significant important to the design and maintenance of multiprocessor systems. A connected graph G is maximally edge-connected (maximally-λ for short) if its edge-connectivity attains its minimum degree. G is super edge-connected (super-λ for short) if every minimum edge-cut isolates one vertex. The edge fault-tolerance of the maximally-λ (resp. super-λ) graph G with respect to the maximally-λ (resp. super-λ) property, denoted by m λ ( G ) (resp. S λ ( G ) ), is the maximum integer m for which G − S is still maximally-λ (resp. super-λ) for any edge subset S with | S | ≤ m . In this paper, we give upper and lower bounds on m λ ( G ) . Furthermore, we completely determine the exact values of m λ ( G ) and S λ ( G ) for vertex transitive graphs. Vertex transitive graph Elsevier Super edge-connected Elsevier Edge fault-tolerance Elsevier Maximally edge-connected Elsevier Chen, Zongqing oth Yang, Weihua oth Meng, Jixiang oth Enthalten in Elsevier 1190 poster EVALUATION OF DEFORMABLE IMAGE CO-REGISTRATION IN ADAPTIVE IMRT FOR HEAD AND NECK CANCER 2011 JCSS San Diego, Calif. [u.a.] (DE-627)ELV010661603 volume:115 year:2021 pages:64-72 extent:9 https://doi.org/10.1016/j.jcss.2020.07.002 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA GBV_ILN_39 GBV_ILN_62 GBV_ILN_90 GBV_ILN_120 GBV_ILN_127 GBV_ILN_227 GBV_ILN_2001 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2011 GBV_ILN_2015 GBV_ILN_2018 GBV_ILN_2094 AR 115 2021 64-72 9 |
| allfieldsGer |
10.1016/j.jcss.2020.07.002 doi /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001164.pica (DE-627)ELV051659840 (ELSEVIER)S0022-0000(20)30069-6 DE-627 ger DE-627 rakwb eng 610 VZ 570 540 VZ Zhao, Shuang verfasserin aut Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs 2021transfer abstract 9 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Edge fault-tolerance of interconnection network is of significant important to the design and maintenance of multiprocessor systems. A connected graph G is maximally edge-connected (maximally-λ for short) if its edge-connectivity attains its minimum degree. G is super edge-connected (super-λ for short) if every minimum edge-cut isolates one vertex. The edge fault-tolerance of the maximally-λ (resp. super-λ) graph G with respect to the maximally-λ (resp. super-λ) property, denoted by m λ ( G ) (resp. S λ ( G ) ), is the maximum integer m for which G − S is still maximally-λ (resp. super-λ) for any edge subset S with | S | ≤ m . In this paper, we give upper and lower bounds on m λ ( G ) . Furthermore, we completely determine the exact values of m λ ( G ) and S λ ( G ) for vertex transitive graphs. Edge fault-tolerance of interconnection network is of significant important to the design and maintenance of multiprocessor systems. A connected graph G is maximally edge-connected (maximally-λ for short) if its edge-connectivity attains its minimum degree. G is super edge-connected (super-λ for short) if every minimum edge-cut isolates one vertex. The edge fault-tolerance of the maximally-λ (resp. super-λ) graph G with respect to the maximally-λ (resp. super-λ) property, denoted by m λ ( G ) (resp. S λ ( G ) ), is the maximum integer m for which G − S is still maximally-λ (resp. super-λ) for any edge subset S with | S | ≤ m . In this paper, we give upper and lower bounds on m λ ( G ) . Furthermore, we completely determine the exact values of m λ ( G ) and S λ ( G ) for vertex transitive graphs. Vertex transitive graph Elsevier Super edge-connected Elsevier Edge fault-tolerance Elsevier Maximally edge-connected Elsevier Chen, Zongqing oth Yang, Weihua oth Meng, Jixiang oth Enthalten in Elsevier 1190 poster EVALUATION OF DEFORMABLE IMAGE CO-REGISTRATION IN ADAPTIVE IMRT FOR HEAD AND NECK CANCER 2011 JCSS San Diego, Calif. [u.a.] (DE-627)ELV010661603 volume:115 year:2021 pages:64-72 extent:9 https://doi.org/10.1016/j.jcss.2020.07.002 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA GBV_ILN_39 GBV_ILN_62 GBV_ILN_90 GBV_ILN_120 GBV_ILN_127 GBV_ILN_227 GBV_ILN_2001 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2011 GBV_ILN_2015 GBV_ILN_2018 GBV_ILN_2094 AR 115 2021 64-72 9 |
| allfieldsSound |
10.1016/j.jcss.2020.07.002 doi /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001164.pica (DE-627)ELV051659840 (ELSEVIER)S0022-0000(20)30069-6 DE-627 ger DE-627 rakwb eng 610 VZ 570 540 VZ Zhao, Shuang verfasserin aut Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs 2021transfer abstract 9 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Edge fault-tolerance of interconnection network is of significant important to the design and maintenance of multiprocessor systems. A connected graph G is maximally edge-connected (maximally-λ for short) if its edge-connectivity attains its minimum degree. G is super edge-connected (super-λ for short) if every minimum edge-cut isolates one vertex. The edge fault-tolerance of the maximally-λ (resp. super-λ) graph G with respect to the maximally-λ (resp. super-λ) property, denoted by m λ ( G ) (resp. S λ ( G ) ), is the maximum integer m for which G − S is still maximally-λ (resp. super-λ) for any edge subset S with | S | ≤ m . In this paper, we give upper and lower bounds on m λ ( G ) . Furthermore, we completely determine the exact values of m λ ( G ) and S λ ( G ) for vertex transitive graphs. Edge fault-tolerance of interconnection network is of significant important to the design and maintenance of multiprocessor systems. A connected graph G is maximally edge-connected (maximally-λ for short) if its edge-connectivity attains its minimum degree. G is super edge-connected (super-λ for short) if every minimum edge-cut isolates one vertex. The edge fault-tolerance of the maximally-λ (resp. super-λ) graph G with respect to the maximally-λ (resp. super-λ) property, denoted by m λ ( G ) (resp. S λ ( G ) ), is the maximum integer m for which G − S is still maximally-λ (resp. super-λ) for any edge subset S with | S | ≤ m . In this paper, we give upper and lower bounds on m λ ( G ) . Furthermore, we completely determine the exact values of m λ ( G ) and S λ ( G ) for vertex transitive graphs. Vertex transitive graph Elsevier Super edge-connected Elsevier Edge fault-tolerance Elsevier Maximally edge-connected Elsevier Chen, Zongqing oth Yang, Weihua oth Meng, Jixiang oth Enthalten in Elsevier 1190 poster EVALUATION OF DEFORMABLE IMAGE CO-REGISTRATION IN ADAPTIVE IMRT FOR HEAD AND NECK CANCER 2011 JCSS San Diego, Calif. [u.a.] (DE-627)ELV010661603 volume:115 year:2021 pages:64-72 extent:9 https://doi.org/10.1016/j.jcss.2020.07.002 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA GBV_ILN_39 GBV_ILN_62 GBV_ILN_90 GBV_ILN_120 GBV_ILN_127 GBV_ILN_227 GBV_ILN_2001 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2011 GBV_ILN_2015 GBV_ILN_2018 GBV_ILN_2094 AR 115 2021 64-72 9 |
| language |
English |
| source |
Enthalten in 1190 poster EVALUATION OF DEFORMABLE IMAGE CO-REGISTRATION IN ADAPTIVE IMRT FOR HEAD AND NECK CANCER San Diego, Calif. [u.a.] volume:115 year:2021 pages:64-72 extent:9 |
| sourceStr |
Enthalten in 1190 poster EVALUATION OF DEFORMABLE IMAGE CO-REGISTRATION IN ADAPTIVE IMRT FOR HEAD AND NECK CANCER San Diego, Calif. [u.a.] volume:115 year:2021 pages:64-72 extent:9 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Vertex transitive graph Super edge-connected Edge fault-tolerance Maximally edge-connected |
| dewey-raw |
610 |
| isfreeaccess_bool |
false |
| container_title |
1190 poster EVALUATION OF DEFORMABLE IMAGE CO-REGISTRATION IN ADAPTIVE IMRT FOR HEAD AND NECK CANCER |
| authorswithroles_txt_mv |
Zhao, Shuang @@aut@@ Chen, Zongqing @@oth@@ Yang, Weihua @@oth@@ Meng, Jixiang @@oth@@ |
| publishDateDaySort_date |
2021-01-01T00:00:00Z |
| hierarchy_top_id |
ELV010661603 |
| dewey-sort |
3610 |
| id |
ELV051659840 |
| 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">ELV051659840</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230626032304.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">210910s2021 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.jcss.2020.07.002</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">/cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001164.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV051659840</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0022-0000(20)30069-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">610</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">570</subfield><subfield code="a">540</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Zhao, Shuang</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 analysis of maximally edge-connected graphs and super edge-connected graphs</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2021transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">9</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">Edge fault-tolerance of interconnection network is of significant important to the design and maintenance of multiprocessor systems. A connected graph G is maximally edge-connected (maximally-λ for short) if its edge-connectivity attains its minimum degree. G is super edge-connected (super-λ for short) if every minimum edge-cut isolates one vertex. The edge fault-tolerance of the maximally-λ (resp. super-λ) graph G with respect to the maximally-λ (resp. super-λ) property, denoted by m λ ( G ) (resp. S λ ( G ) ), is the maximum integer m for which G − S is still maximally-λ (resp. super-λ) for any edge subset S with | S | ≤ m . In this paper, we give upper and lower bounds on m λ ( G ) . Furthermore, we completely determine the exact values of m λ ( G ) and S λ ( G ) for vertex transitive graphs.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Edge fault-tolerance of interconnection network is of significant important to the design and maintenance of multiprocessor systems. A connected graph G is maximally edge-connected (maximally-λ for short) if its edge-connectivity attains its minimum degree. G is super edge-connected (super-λ for short) if every minimum edge-cut isolates one vertex. The edge fault-tolerance of the maximally-λ (resp. super-λ) graph G with respect to the maximally-λ (resp. super-λ) property, denoted by m λ ( G ) (resp. S λ ( G ) ), is the maximum integer m for which G − S is still maximally-λ (resp. super-λ) for any edge subset S with | S | ≤ m . In this paper, we give upper and lower bounds on m λ ( G ) . Furthermore, we completely determine the exact values of m λ ( G ) and S λ ( G ) for vertex transitive graphs.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Vertex transitive graph</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Super edge-connected</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">Maximally edge-connected</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Chen, Zongqing</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yang, Weihua</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="t">1190 poster EVALUATION OF DEFORMABLE IMAGE CO-REGISTRATION IN ADAPTIVE IMRT FOR HEAD AND NECK CANCER</subfield><subfield code="d">2011</subfield><subfield code="d">JCSS</subfield><subfield code="g">San Diego, Calif. [u.a.]</subfield><subfield code="w">(DE-627)ELV010661603</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:115</subfield><subfield code="g">year:2021</subfield><subfield code="g">pages:64-72</subfield><subfield code="g">extent:9</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.jcss.2020.07.002</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">SSG-OLC-PHA</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</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_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_127</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_227</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_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_2011</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_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2094</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">115</subfield><subfield code="j">2021</subfield><subfield code="h">64-72</subfield><subfield code="g">9</subfield></datafield></record></collection>
|
| author |
Zhao, Shuang |
| spellingShingle |
Zhao, Shuang ddc 610 ddc 570 Elsevier Vertex transitive graph Elsevier Super edge-connected Elsevier Edge fault-tolerance Elsevier Maximally edge-connected Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs |
| authorStr |
Zhao, Shuang |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)ELV010661603 |
| format |
electronic Article |
| dewey-ones |
610 - Medicine & health 570 - Life sciences; biology 540 - Chemistry & allied sciences |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
elsevier |
| remote_str |
true |
| illustrated |
Not Illustrated |
| topic_title |
610 VZ 570 540 VZ Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs Vertex transitive graph Elsevier Super edge-connected Elsevier Edge fault-tolerance Elsevier Maximally edge-connected Elsevier |
| topic |
ddc 610 ddc 570 Elsevier Vertex transitive graph Elsevier Super edge-connected Elsevier Edge fault-tolerance Elsevier Maximally edge-connected |
| topic_unstemmed |
ddc 610 ddc 570 Elsevier Vertex transitive graph Elsevier Super edge-connected Elsevier Edge fault-tolerance Elsevier Maximally edge-connected |
| topic_browse |
ddc 610 ddc 570 Elsevier Vertex transitive graph Elsevier Super edge-connected Elsevier Edge fault-tolerance Elsevier Maximally edge-connected |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
zu |
| author2_variant |
z c zc w y wy j m jm |
| hierarchy_parent_title |
1190 poster EVALUATION OF DEFORMABLE IMAGE CO-REGISTRATION IN ADAPTIVE IMRT FOR HEAD AND NECK CANCER |
| hierarchy_parent_id |
ELV010661603 |
| dewey-tens |
610 - Medicine & health 570 - Life sciences; biology 540 - Chemistry |
| hierarchy_top_title |
1190 poster EVALUATION OF DEFORMABLE IMAGE CO-REGISTRATION IN ADAPTIVE IMRT FOR HEAD AND NECK CANCER |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)ELV010661603 |
| title |
Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs |
| ctrlnum |
(DE-627)ELV051659840 (ELSEVIER)S0022-0000(20)30069-6 |
| title_full |
Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs |
| author_sort |
Zhao, Shuang |
| journal |
1190 poster EVALUATION OF DEFORMABLE IMAGE CO-REGISTRATION IN ADAPTIVE IMRT FOR HEAD AND NECK CANCER |
| journalStr |
1190 poster EVALUATION OF DEFORMABLE IMAGE CO-REGISTRATION IN ADAPTIVE IMRT FOR HEAD AND NECK CANCER |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
600 - Technology 500 - Science |
| recordtype |
marc |
| publishDateSort |
2021 |
| contenttype_str_mv |
zzz |
| container_start_page |
64 |
| author_browse |
Zhao, Shuang |
| container_volume |
115 |
| physical |
9 |
| class |
610 VZ 570 540 VZ |
| format_se |
Elektronische Aufsätze |
| author-letter |
Zhao, Shuang |
| doi_str_mv |
10.1016/j.jcss.2020.07.002 |
| dewey-full |
610 570 540 |
| title_sort |
edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs |
| title_auth |
Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs |
| abstract |
Edge fault-tolerance of interconnection network is of significant important to the design and maintenance of multiprocessor systems. A connected graph G is maximally edge-connected (maximally-λ for short) if its edge-connectivity attains its minimum degree. G is super edge-connected (super-λ for short) if every minimum edge-cut isolates one vertex. The edge fault-tolerance of the maximally-λ (resp. super-λ) graph G with respect to the maximally-λ (resp. super-λ) property, denoted by m λ ( G ) (resp. S λ ( G ) ), is the maximum integer m for which G − S is still maximally-λ (resp. super-λ) for any edge subset S with | S | ≤ m . In this paper, we give upper and lower bounds on m λ ( G ) . Furthermore, we completely determine the exact values of m λ ( G ) and S λ ( G ) for vertex transitive graphs. |
| abstractGer |
Edge fault-tolerance of interconnection network is of significant important to the design and maintenance of multiprocessor systems. A connected graph G is maximally edge-connected (maximally-λ for short) if its edge-connectivity attains its minimum degree. G is super edge-connected (super-λ for short) if every minimum edge-cut isolates one vertex. The edge fault-tolerance of the maximally-λ (resp. super-λ) graph G with respect to the maximally-λ (resp. super-λ) property, denoted by m λ ( G ) (resp. S λ ( G ) ), is the maximum integer m for which G − S is still maximally-λ (resp. super-λ) for any edge subset S with | S | ≤ m . In this paper, we give upper and lower bounds on m λ ( G ) . Furthermore, we completely determine the exact values of m λ ( G ) and S λ ( G ) for vertex transitive graphs. |
| abstract_unstemmed |
Edge fault-tolerance of interconnection network is of significant important to the design and maintenance of multiprocessor systems. A connected graph G is maximally edge-connected (maximally-λ for short) if its edge-connectivity attains its minimum degree. G is super edge-connected (super-λ for short) if every minimum edge-cut isolates one vertex. The edge fault-tolerance of the maximally-λ (resp. super-λ) graph G with respect to the maximally-λ (resp. super-λ) property, denoted by m λ ( G ) (resp. S λ ( G ) ), is the maximum integer m for which G − S is still maximally-λ (resp. super-λ) for any edge subset S with | S | ≤ m . In this paper, we give upper and lower bounds on m λ ( G ) . Furthermore, we completely determine the exact values of m λ ( G ) and S λ ( G ) for vertex transitive graphs. |
| collection_details |
GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA GBV_ILN_39 GBV_ILN_62 GBV_ILN_90 GBV_ILN_120 GBV_ILN_127 GBV_ILN_227 GBV_ILN_2001 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2011 GBV_ILN_2015 GBV_ILN_2018 GBV_ILN_2094 |
| title_short |
Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs |
| url |
https://doi.org/10.1016/j.jcss.2020.07.002 |
| remote_bool |
true |
| author2 |
Chen, Zongqing Yang, Weihua Meng, Jixiang |
| author2Str |
Chen, Zongqing Yang, Weihua Meng, Jixiang |
| ppnlink |
ELV010661603 |
| mediatype_str_mv |
z |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth oth oth |
| doi_str |
10.1016/j.jcss.2020.07.002 |
| up_date |
2024-07-06T20:52:17.179Z |
| _version_ |
1803864388066607104 |
| 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">ELV051659840</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230626032304.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">210910s2021 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.jcss.2020.07.002</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">/cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001164.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV051659840</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0022-0000(20)30069-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">610</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">570</subfield><subfield code="a">540</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Zhao, Shuang</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 analysis of maximally edge-connected graphs and super edge-connected graphs</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2021transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">9</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">Edge fault-tolerance of interconnection network is of significant important to the design and maintenance of multiprocessor systems. A connected graph G is maximally edge-connected (maximally-λ for short) if its edge-connectivity attains its minimum degree. G is super edge-connected (super-λ for short) if every minimum edge-cut isolates one vertex. The edge fault-tolerance of the maximally-λ (resp. super-λ) graph G with respect to the maximally-λ (resp. super-λ) property, denoted by m λ ( G ) (resp. S λ ( G ) ), is the maximum integer m for which G − S is still maximally-λ (resp. super-λ) for any edge subset S with | S | ≤ m . In this paper, we give upper and lower bounds on m λ ( G ) . Furthermore, we completely determine the exact values of m λ ( G ) and S λ ( G ) for vertex transitive graphs.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Edge fault-tolerance of interconnection network is of significant important to the design and maintenance of multiprocessor systems. A connected graph G is maximally edge-connected (maximally-λ for short) if its edge-connectivity attains its minimum degree. G is super edge-connected (super-λ for short) if every minimum edge-cut isolates one vertex. The edge fault-tolerance of the maximally-λ (resp. super-λ) graph G with respect to the maximally-λ (resp. super-λ) property, denoted by m λ ( G ) (resp. S λ ( G ) ), is the maximum integer m for which G − S is still maximally-λ (resp. super-λ) for any edge subset S with | S | ≤ m . In this paper, we give upper and lower bounds on m λ ( G ) . Furthermore, we completely determine the exact values of m λ ( G ) and S λ ( G ) for vertex transitive graphs.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Vertex transitive graph</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Super edge-connected</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">Maximally edge-connected</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Chen, Zongqing</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yang, Weihua</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="t">1190 poster EVALUATION OF DEFORMABLE IMAGE CO-REGISTRATION IN ADAPTIVE IMRT FOR HEAD AND NECK CANCER</subfield><subfield code="d">2011</subfield><subfield code="d">JCSS</subfield><subfield code="g">San Diego, Calif. [u.a.]</subfield><subfield code="w">(DE-627)ELV010661603</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:115</subfield><subfield code="g">year:2021</subfield><subfield code="g">pages:64-72</subfield><subfield code="g">extent:9</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.jcss.2020.07.002</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">SSG-OLC-PHA</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</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_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_127</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_227</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_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_2011</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_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2094</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">115</subfield><subfield code="j">2021</subfield><subfield code="h">64-72</subfield><subfield code="g">9</subfield></datafield></record></collection>
|
| score |
7.4003096 |