On Resilient Graph Spanners
Abstract We introduce and investigate a new notion of resilience in graph spanners. Let $$S$$ be a spanner of a weighted graph $$G$$. Roughly speaking, we say that $$S$$ is resilient if all its point-to-point distances are resilient to edge failures. Namely, whenever any edge in $$G$$ fails, then as...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Ausiello, Giorgio [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2015 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer Science+Business Media New York 2015 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Algorithmica - Springer US, 1986, 74(2015), 4 vom: 02. Mai, Seite 1363-1385 |
|---|---|
| Übergeordnetes Werk: |
volume:74 ; year:2015 ; number:4 ; day:02 ; month:05 ; pages:1363-1385 |
| Links: |
|---|
| DOI / URN: |
10.1007/s00453-015-0006-x |
|---|
| Katalog-ID: |
OLC2054849111 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2054849111 | ||
| 003 | DE-627 | ||
| 005 | 20230403074147.0 | ||
| 007 | tu | ||
| 008 | 200819s2015 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s00453-015-0006-x |2 doi | |
| 035 | |a (DE-627)OLC2054849111 | ||
| 035 | |a (DE-He213)s00453-015-0006-x-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q VZ |
| 082 | 0 | 4 | |a 510 |a 004 |q VZ |
| 100 | 1 | |a Ausiello, Giorgio |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a On Resilient Graph Spanners |
| 264 | 1 | |c 2015 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer Science+Business Media New York 2015 | ||
| 520 | |a Abstract We introduce and investigate a new notion of resilience in graph spanners. Let $$S$$ be a spanner of a weighted graph $$G$$. Roughly speaking, we say that $$S$$ is resilient if all its point-to-point distances are resilient to edge failures. Namely, whenever any edge in $$G$$ fails, then as a consequence of this failure all distances do not degrade in $$S$$ substantially more than in $$G$$ (i.e., the relative distance increases in $$S$$ are very close to those in the underlying graph $$G$$). In this paper we show that sparse resilient spanners exist, and that they can be computed efficiently. | ||
| 650 | 4 | |a Graph algorithms | |
| 650 | 4 | |a Graph spanners | |
| 650 | 4 | |a Fault tolerance | |
| 650 | 4 | |a Algorithm complexity | |
| 700 | 1 | |a Franciosa, Paolo G. |4 aut | |
| 700 | 1 | |a Italiano, Giuseppe F. |4 aut | |
| 700 | 1 | |a Ribichini, Andrea |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Algorithmica |d Springer US, 1986 |g 74(2015), 4 vom: 02. Mai, Seite 1363-1385 |w (DE-627)129197564 |w (DE-600)53958-2 |w (DE-576)014456958 |x 0178-4617 |7 nnns |
| 773 | 1 | 8 | |g volume:74 |g year:2015 |g number:4 |g day:02 |g month:05 |g pages:1363-1385 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s00453-015-0006-x |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a SSG-OPC-MAT | ||
| 912 | |a GBV_ILN_24 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_130 | ||
| 912 | |a GBV_ILN_2018 | ||
| 912 | |a GBV_ILN_4266 | ||
| 912 | |a GBV_ILN_4318 | ||
| 912 | |a GBV_ILN_4319 | ||
| 951 | |a AR | ||
| 952 | |d 74 |j 2015 |e 4 |b 02 |c 05 |h 1363-1385 | ||
| author_variant |
g a ga p g f pg pgf g f i gf gfi a r ar |
|---|---|
| matchkey_str |
article:01784617:2015----::neiingahp |
| hierarchy_sort_str |
2015 |
| publishDate |
2015 |
| allfields |
10.1007/s00453-015-0006-x doi (DE-627)OLC2054849111 (DE-He213)s00453-015-0006-x-p DE-627 ger DE-627 rakwb eng 004 VZ 510 004 VZ Ausiello, Giorgio verfasserin aut On Resilient Graph Spanners 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2015 Abstract We introduce and investigate a new notion of resilience in graph spanners. Let $$S$$ be a spanner of a weighted graph $$G$$. Roughly speaking, we say that $$S$$ is resilient if all its point-to-point distances are resilient to edge failures. Namely, whenever any edge in $$G$$ fails, then as a consequence of this failure all distances do not degrade in $$S$$ substantially more than in $$G$$ (i.e., the relative distance increases in $$S$$ are very close to those in the underlying graph $$G$$). In this paper we show that sparse resilient spanners exist, and that they can be computed efficiently. Graph algorithms Graph spanners Fault tolerance Algorithm complexity Franciosa, Paolo G. aut Italiano, Giuseppe F. aut Ribichini, Andrea aut Enthalten in Algorithmica Springer US, 1986 74(2015), 4 vom: 02. Mai, Seite 1363-1385 (DE-627)129197564 (DE-600)53958-2 (DE-576)014456958 0178-4617 nnns volume:74 year:2015 number:4 day:02 month:05 pages:1363-1385 https://doi.org/10.1007/s00453-015-0006-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_24 GBV_ILN_70 GBV_ILN_130 GBV_ILN_2018 GBV_ILN_4266 GBV_ILN_4318 GBV_ILN_4319 AR 74 2015 4 02 05 1363-1385 |
| spelling |
10.1007/s00453-015-0006-x doi (DE-627)OLC2054849111 (DE-He213)s00453-015-0006-x-p DE-627 ger DE-627 rakwb eng 004 VZ 510 004 VZ Ausiello, Giorgio verfasserin aut On Resilient Graph Spanners 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2015 Abstract We introduce and investigate a new notion of resilience in graph spanners. Let $$S$$ be a spanner of a weighted graph $$G$$. Roughly speaking, we say that $$S$$ is resilient if all its point-to-point distances are resilient to edge failures. Namely, whenever any edge in $$G$$ fails, then as a consequence of this failure all distances do not degrade in $$S$$ substantially more than in $$G$$ (i.e., the relative distance increases in $$S$$ are very close to those in the underlying graph $$G$$). In this paper we show that sparse resilient spanners exist, and that they can be computed efficiently. Graph algorithms Graph spanners Fault tolerance Algorithm complexity Franciosa, Paolo G. aut Italiano, Giuseppe F. aut Ribichini, Andrea aut Enthalten in Algorithmica Springer US, 1986 74(2015), 4 vom: 02. Mai, Seite 1363-1385 (DE-627)129197564 (DE-600)53958-2 (DE-576)014456958 0178-4617 nnns volume:74 year:2015 number:4 day:02 month:05 pages:1363-1385 https://doi.org/10.1007/s00453-015-0006-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_24 GBV_ILN_70 GBV_ILN_130 GBV_ILN_2018 GBV_ILN_4266 GBV_ILN_4318 GBV_ILN_4319 AR 74 2015 4 02 05 1363-1385 |
| allfields_unstemmed |
10.1007/s00453-015-0006-x doi (DE-627)OLC2054849111 (DE-He213)s00453-015-0006-x-p DE-627 ger DE-627 rakwb eng 004 VZ 510 004 VZ Ausiello, Giorgio verfasserin aut On Resilient Graph Spanners 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2015 Abstract We introduce and investigate a new notion of resilience in graph spanners. Let $$S$$ be a spanner of a weighted graph $$G$$. Roughly speaking, we say that $$S$$ is resilient if all its point-to-point distances are resilient to edge failures. Namely, whenever any edge in $$G$$ fails, then as a consequence of this failure all distances do not degrade in $$S$$ substantially more than in $$G$$ (i.e., the relative distance increases in $$S$$ are very close to those in the underlying graph $$G$$). In this paper we show that sparse resilient spanners exist, and that they can be computed efficiently. Graph algorithms Graph spanners Fault tolerance Algorithm complexity Franciosa, Paolo G. aut Italiano, Giuseppe F. aut Ribichini, Andrea aut Enthalten in Algorithmica Springer US, 1986 74(2015), 4 vom: 02. Mai, Seite 1363-1385 (DE-627)129197564 (DE-600)53958-2 (DE-576)014456958 0178-4617 nnns volume:74 year:2015 number:4 day:02 month:05 pages:1363-1385 https://doi.org/10.1007/s00453-015-0006-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_24 GBV_ILN_70 GBV_ILN_130 GBV_ILN_2018 GBV_ILN_4266 GBV_ILN_4318 GBV_ILN_4319 AR 74 2015 4 02 05 1363-1385 |
| allfieldsGer |
10.1007/s00453-015-0006-x doi (DE-627)OLC2054849111 (DE-He213)s00453-015-0006-x-p DE-627 ger DE-627 rakwb eng 004 VZ 510 004 VZ Ausiello, Giorgio verfasserin aut On Resilient Graph Spanners 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2015 Abstract We introduce and investigate a new notion of resilience in graph spanners. Let $$S$$ be a spanner of a weighted graph $$G$$. Roughly speaking, we say that $$S$$ is resilient if all its point-to-point distances are resilient to edge failures. Namely, whenever any edge in $$G$$ fails, then as a consequence of this failure all distances do not degrade in $$S$$ substantially more than in $$G$$ (i.e., the relative distance increases in $$S$$ are very close to those in the underlying graph $$G$$). In this paper we show that sparse resilient spanners exist, and that they can be computed efficiently. Graph algorithms Graph spanners Fault tolerance Algorithm complexity Franciosa, Paolo G. aut Italiano, Giuseppe F. aut Ribichini, Andrea aut Enthalten in Algorithmica Springer US, 1986 74(2015), 4 vom: 02. Mai, Seite 1363-1385 (DE-627)129197564 (DE-600)53958-2 (DE-576)014456958 0178-4617 nnns volume:74 year:2015 number:4 day:02 month:05 pages:1363-1385 https://doi.org/10.1007/s00453-015-0006-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_24 GBV_ILN_70 GBV_ILN_130 GBV_ILN_2018 GBV_ILN_4266 GBV_ILN_4318 GBV_ILN_4319 AR 74 2015 4 02 05 1363-1385 |
| allfieldsSound |
10.1007/s00453-015-0006-x doi (DE-627)OLC2054849111 (DE-He213)s00453-015-0006-x-p DE-627 ger DE-627 rakwb eng 004 VZ 510 004 VZ Ausiello, Giorgio verfasserin aut On Resilient Graph Spanners 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2015 Abstract We introduce and investigate a new notion of resilience in graph spanners. Let $$S$$ be a spanner of a weighted graph $$G$$. Roughly speaking, we say that $$S$$ is resilient if all its point-to-point distances are resilient to edge failures. Namely, whenever any edge in $$G$$ fails, then as a consequence of this failure all distances do not degrade in $$S$$ substantially more than in $$G$$ (i.e., the relative distance increases in $$S$$ are very close to those in the underlying graph $$G$$). In this paper we show that sparse resilient spanners exist, and that they can be computed efficiently. Graph algorithms Graph spanners Fault tolerance Algorithm complexity Franciosa, Paolo G. aut Italiano, Giuseppe F. aut Ribichini, Andrea aut Enthalten in Algorithmica Springer US, 1986 74(2015), 4 vom: 02. Mai, Seite 1363-1385 (DE-627)129197564 (DE-600)53958-2 (DE-576)014456958 0178-4617 nnns volume:74 year:2015 number:4 day:02 month:05 pages:1363-1385 https://doi.org/10.1007/s00453-015-0006-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_24 GBV_ILN_70 GBV_ILN_130 GBV_ILN_2018 GBV_ILN_4266 GBV_ILN_4318 GBV_ILN_4319 AR 74 2015 4 02 05 1363-1385 |
| language |
English |
| source |
Enthalten in Algorithmica 74(2015), 4 vom: 02. Mai, Seite 1363-1385 volume:74 year:2015 number:4 day:02 month:05 pages:1363-1385 |
| sourceStr |
Enthalten in Algorithmica 74(2015), 4 vom: 02. Mai, Seite 1363-1385 volume:74 year:2015 number:4 day:02 month:05 pages:1363-1385 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Graph algorithms Graph spanners Fault tolerance Algorithm complexity |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Algorithmica |
| authorswithroles_txt_mv |
Ausiello, Giorgio @@aut@@ Franciosa, Paolo G. @@aut@@ Italiano, Giuseppe F. @@aut@@ Ribichini, Andrea @@aut@@ |
| publishDateDaySort_date |
2015-05-02T00:00:00Z |
| hierarchy_top_id |
129197564 |
| dewey-sort |
14 |
| id |
OLC2054849111 |
| 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">OLC2054849111</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230403074147.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2015 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00453-015-0006-x</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2054849111</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00453-015-0006-x-p</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">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ausiello, Giorgio</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On Resilient Graph Spanners</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media New York 2015</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract We introduce and investigate a new notion of resilience in graph spanners. Let $$S$$ be a spanner of a weighted graph $$G$$. Roughly speaking, we say that $$S$$ is resilient if all its point-to-point distances are resilient to edge failures. Namely, whenever any edge in $$G$$ fails, then as a consequence of this failure all distances do not degrade in $$S$$ substantially more than in $$G$$ (i.e., the relative distance increases in $$S$$ are very close to those in the underlying graph $$G$$). In this paper we show that sparse resilient spanners exist, and that they can be computed efficiently.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph spanners</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fault tolerance</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithm complexity</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Franciosa, Paolo G.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Italiano, Giuseppe F.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ribichini, Andrea</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Algorithmica</subfield><subfield code="d">Springer US, 1986</subfield><subfield code="g">74(2015), 4 vom: 02. Mai, Seite 1363-1385</subfield><subfield code="w">(DE-627)129197564</subfield><subfield code="w">(DE-600)53958-2</subfield><subfield code="w">(DE-576)014456958</subfield><subfield code="x">0178-4617</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:74</subfield><subfield code="g">year:2015</subfield><subfield code="g">number:4</subfield><subfield code="g">day:02</subfield><subfield code="g">month:05</subfield><subfield code="g">pages:1363-1385</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00453-015-0006-x</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</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_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_130</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_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4319</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">74</subfield><subfield code="j">2015</subfield><subfield code="e">4</subfield><subfield code="b">02</subfield><subfield code="c">05</subfield><subfield code="h">1363-1385</subfield></datafield></record></collection>
|
| author |
Ausiello, Giorgio |
| spellingShingle |
Ausiello, Giorgio ddc 004 ddc 510 misc Graph algorithms misc Graph spanners misc Fault tolerance misc Algorithm complexity On Resilient Graph Spanners |
| authorStr |
Ausiello, Giorgio |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)129197564 |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science 510 - Mathematics |
| delete_txt_mv |
keep |
| author_role |
aut aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0178-4617 |
| topic_title |
004 VZ 510 004 VZ On Resilient Graph Spanners Graph algorithms Graph spanners Fault tolerance Algorithm complexity |
| topic |
ddc 004 ddc 510 misc Graph algorithms misc Graph spanners misc Fault tolerance misc Algorithm complexity |
| topic_unstemmed |
ddc 004 ddc 510 misc Graph algorithms misc Graph spanners misc Fault tolerance misc Algorithm complexity |
| topic_browse |
ddc 004 ddc 510 misc Graph algorithms misc Graph spanners misc Fault tolerance misc Algorithm complexity |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Algorithmica |
| hierarchy_parent_id |
129197564 |
| dewey-tens |
000 - Computer science, knowledge & systems 510 - Mathematics |
| hierarchy_top_title |
Algorithmica |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)129197564 (DE-600)53958-2 (DE-576)014456958 |
| title |
On Resilient Graph Spanners |
| ctrlnum |
(DE-627)OLC2054849111 (DE-He213)s00453-015-0006-x-p |
| title_full |
On Resilient Graph Spanners |
| author_sort |
Ausiello, Giorgio |
| journal |
Algorithmica |
| journalStr |
Algorithmica |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works 500 - Science |
| recordtype |
marc |
| publishDateSort |
2015 |
| contenttype_str_mv |
txt |
| container_start_page |
1363 |
| author_browse |
Ausiello, Giorgio Franciosa, Paolo G. Italiano, Giuseppe F. Ribichini, Andrea |
| container_volume |
74 |
| class |
004 VZ 510 004 VZ |
| format_se |
Aufsätze |
| author-letter |
Ausiello, Giorgio |
| doi_str_mv |
10.1007/s00453-015-0006-x |
| dewey-full |
004 510 |
| title_sort |
on resilient graph spanners |
| title_auth |
On Resilient Graph Spanners |
| abstract |
Abstract We introduce and investigate a new notion of resilience in graph spanners. Let $$S$$ be a spanner of a weighted graph $$G$$. Roughly speaking, we say that $$S$$ is resilient if all its point-to-point distances are resilient to edge failures. Namely, whenever any edge in $$G$$ fails, then as a consequence of this failure all distances do not degrade in $$S$$ substantially more than in $$G$$ (i.e., the relative distance increases in $$S$$ are very close to those in the underlying graph $$G$$). In this paper we show that sparse resilient spanners exist, and that they can be computed efficiently. © Springer Science+Business Media New York 2015 |
| abstractGer |
Abstract We introduce and investigate a new notion of resilience in graph spanners. Let $$S$$ be a spanner of a weighted graph $$G$$. Roughly speaking, we say that $$S$$ is resilient if all its point-to-point distances are resilient to edge failures. Namely, whenever any edge in $$G$$ fails, then as a consequence of this failure all distances do not degrade in $$S$$ substantially more than in $$G$$ (i.e., the relative distance increases in $$S$$ are very close to those in the underlying graph $$G$$). In this paper we show that sparse resilient spanners exist, and that they can be computed efficiently. © Springer Science+Business Media New York 2015 |
| abstract_unstemmed |
Abstract We introduce and investigate a new notion of resilience in graph spanners. Let $$S$$ be a spanner of a weighted graph $$G$$. Roughly speaking, we say that $$S$$ is resilient if all its point-to-point distances are resilient to edge failures. Namely, whenever any edge in $$G$$ fails, then as a consequence of this failure all distances do not degrade in $$S$$ substantially more than in $$G$$ (i.e., the relative distance increases in $$S$$ are very close to those in the underlying graph $$G$$). In this paper we show that sparse resilient spanners exist, and that they can be computed efficiently. © Springer Science+Business Media New York 2015 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_24 GBV_ILN_70 GBV_ILN_130 GBV_ILN_2018 GBV_ILN_4266 GBV_ILN_4318 GBV_ILN_4319 |
| container_issue |
4 |
| title_short |
On Resilient Graph Spanners |
| url |
https://doi.org/10.1007/s00453-015-0006-x |
| remote_bool |
false |
| author2 |
Franciosa, Paolo G. Italiano, Giuseppe F. Ribichini, Andrea |
| author2Str |
Franciosa, Paolo G. Italiano, Giuseppe F. Ribichini, Andrea |
| ppnlink |
129197564 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s00453-015-0006-x |
| up_date |
2024-07-04T00:36:11.398Z |
| _version_ |
1803606683968077824 |
| 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">OLC2054849111</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230403074147.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2015 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00453-015-0006-x</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2054849111</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00453-015-0006-x-p</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">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ausiello, Giorgio</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On Resilient Graph Spanners</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media New York 2015</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract We introduce and investigate a new notion of resilience in graph spanners. Let $$S$$ be a spanner of a weighted graph $$G$$. Roughly speaking, we say that $$S$$ is resilient if all its point-to-point distances are resilient to edge failures. Namely, whenever any edge in $$G$$ fails, then as a consequence of this failure all distances do not degrade in $$S$$ substantially more than in $$G$$ (i.e., the relative distance increases in $$S$$ are very close to those in the underlying graph $$G$$). In this paper we show that sparse resilient spanners exist, and that they can be computed efficiently.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph spanners</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fault tolerance</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithm complexity</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Franciosa, Paolo G.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Italiano, Giuseppe F.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ribichini, Andrea</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Algorithmica</subfield><subfield code="d">Springer US, 1986</subfield><subfield code="g">74(2015), 4 vom: 02. Mai, Seite 1363-1385</subfield><subfield code="w">(DE-627)129197564</subfield><subfield code="w">(DE-600)53958-2</subfield><subfield code="w">(DE-576)014456958</subfield><subfield code="x">0178-4617</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:74</subfield><subfield code="g">year:2015</subfield><subfield code="g">number:4</subfield><subfield code="g">day:02</subfield><subfield code="g">month:05</subfield><subfield code="g">pages:1363-1385</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00453-015-0006-x</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</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_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_130</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_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4319</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">74</subfield><subfield code="j">2015</subfield><subfield code="e">4</subfield><subfield code="b">02</subfield><subfield code="c">05</subfield><subfield code="h">1363-1385</subfield></datafield></record></collection>
|
| score |
7.401993 |