Composed Degree-Distance Realizations of Graphs
Abstract Network realization problems require, given a specification $$\pi $$ for some network parameter (such as degrees, distances or connectivity), to construct a network G conforming to $$\pi $$, or to determine that no such network exists. In this paper we study composed profile realization, wh...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Bar-Noy, Amotz [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2022 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. |
|---|
| Übergeordnetes Werk: |
Enthalten in: Algorithmica - Springer US, 1986, 85(2022), 3 vom: 08. Nov., Seite 665-687 |
|---|---|
| Übergeordnetes Werk: |
volume:85 ; year:2022 ; number:3 ; day:08 ; month:11 ; pages:665-687 |
| Links: |
|---|
| DOI / URN: |
10.1007/s00453-022-01055-2 |
|---|
| Katalog-ID: |
OLC2134275294 |
|---|
| LEADER | 01000naa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2134275294 | ||
| 003 | DE-627 | ||
| 005 | 20230506162656.0 | ||
| 007 | tu | ||
| 008 | 230506s2022 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s00453-022-01055-2 |2 doi | |
| 035 | |a (DE-627)OLC2134275294 | ||
| 035 | |a (DE-He213)s00453-022-01055-2-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 Bar-Noy, Amotz |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Composed Degree-Distance Realizations of Graphs |
| 264 | 1 | |c 2022 | |
| 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 © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. | ||
| 520 | |a Abstract Network realization problems require, given a specification $$\pi $$ for some network parameter (such as degrees, distances or connectivity), to construct a network G conforming to $$\pi $$, or to determine that no such network exists. In this paper we study composed profile realization, where the given instance consists of two or more profile specifications that need to be realized simultaneously. To gain some understanding of the problem, we focus on two classical profile types, namely, degrees and distances, which were (separately) studied extensively in the past. We investigate a wide spectrum of variants of the composed distance and degree realization problem. For each variant we either give a polynomial-time realization algorithm or establish NP hardness. In particular: We consider both precise specifications and range specifications, which specify a range of permissible values for each entry of the profile.We consider realizations by both weighted and unweighted graphs.We also study settings where the realizing graph is restricted to specific graph classes, including trees and bipartite graphs. | ||
| 650 | 4 | |a Composed graph realization | |
| 650 | 4 | |a Degree realization | |
| 650 | 4 | |a Distance realization | |
| 650 | 4 | |a Graphic sequences | |
| 650 | 4 | |a Network design | |
| 700 | 1 | |a Peleg, David |4 aut | |
| 700 | 1 | |a Perry, Mor |4 aut | |
| 700 | 1 | |a Rawitz, Dror |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Algorithmica |d Springer US, 1986 |g 85(2022), 3 vom: 08. Nov., Seite 665-687 |w (DE-627)129197564 |w (DE-600)53958-2 |w (DE-576)014456958 |x 0178-4617 |7 nnns |
| 773 | 1 | 8 | |g volume:85 |g year:2022 |g number:3 |g day:08 |g month:11 |g pages:665-687 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s00453-022-01055-2 |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_70 | ||
| 912 | |a GBV_ILN_2018 | ||
| 951 | |a AR | ||
| 952 | |d 85 |j 2022 |e 3 |b 08 |c 11 |h 665-687 | ||
| author_variant |
a b n abn d p dp m p mp d r dr |
|---|---|
| matchkey_str |
article:01784617:2022----::opsdereitneelzt |
| hierarchy_sort_str |
2022 |
| publishDate |
2022 |
| allfields |
10.1007/s00453-022-01055-2 doi (DE-627)OLC2134275294 (DE-He213)s00453-022-01055-2-p DE-627 ger DE-627 rakwb eng 004 VZ 510 004 VZ Bar-Noy, Amotz verfasserin aut Composed Degree-Distance Realizations of Graphs 2022 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. Abstract Network realization problems require, given a specification $$\pi $$ for some network parameter (such as degrees, distances or connectivity), to construct a network G conforming to $$\pi $$, or to determine that no such network exists. In this paper we study composed profile realization, where the given instance consists of two or more profile specifications that need to be realized simultaneously. To gain some understanding of the problem, we focus on two classical profile types, namely, degrees and distances, which were (separately) studied extensively in the past. We investigate a wide spectrum of variants of the composed distance and degree realization problem. For each variant we either give a polynomial-time realization algorithm or establish NP hardness. In particular: We consider both precise specifications and range specifications, which specify a range of permissible values for each entry of the profile.We consider realizations by both weighted and unweighted graphs.We also study settings where the realizing graph is restricted to specific graph classes, including trees and bipartite graphs. Composed graph realization Degree realization Distance realization Graphic sequences Network design Peleg, David aut Perry, Mor aut Rawitz, Dror aut Enthalten in Algorithmica Springer US, 1986 85(2022), 3 vom: 08. Nov., Seite 665-687 (DE-627)129197564 (DE-600)53958-2 (DE-576)014456958 0178-4617 nnns volume:85 year:2022 number:3 day:08 month:11 pages:665-687 https://doi.org/10.1007/s00453-022-01055-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 GBV_ILN_2018 AR 85 2022 3 08 11 665-687 |
| spelling |
10.1007/s00453-022-01055-2 doi (DE-627)OLC2134275294 (DE-He213)s00453-022-01055-2-p DE-627 ger DE-627 rakwb eng 004 VZ 510 004 VZ Bar-Noy, Amotz verfasserin aut Composed Degree-Distance Realizations of Graphs 2022 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. Abstract Network realization problems require, given a specification $$\pi $$ for some network parameter (such as degrees, distances or connectivity), to construct a network G conforming to $$\pi $$, or to determine that no such network exists. In this paper we study composed profile realization, where the given instance consists of two or more profile specifications that need to be realized simultaneously. To gain some understanding of the problem, we focus on two classical profile types, namely, degrees and distances, which were (separately) studied extensively in the past. We investigate a wide spectrum of variants of the composed distance and degree realization problem. For each variant we either give a polynomial-time realization algorithm or establish NP hardness. In particular: We consider both precise specifications and range specifications, which specify a range of permissible values for each entry of the profile.We consider realizations by both weighted and unweighted graphs.We also study settings where the realizing graph is restricted to specific graph classes, including trees and bipartite graphs. Composed graph realization Degree realization Distance realization Graphic sequences Network design Peleg, David aut Perry, Mor aut Rawitz, Dror aut Enthalten in Algorithmica Springer US, 1986 85(2022), 3 vom: 08. Nov., Seite 665-687 (DE-627)129197564 (DE-600)53958-2 (DE-576)014456958 0178-4617 nnns volume:85 year:2022 number:3 day:08 month:11 pages:665-687 https://doi.org/10.1007/s00453-022-01055-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 GBV_ILN_2018 AR 85 2022 3 08 11 665-687 |
| allfields_unstemmed |
10.1007/s00453-022-01055-2 doi (DE-627)OLC2134275294 (DE-He213)s00453-022-01055-2-p DE-627 ger DE-627 rakwb eng 004 VZ 510 004 VZ Bar-Noy, Amotz verfasserin aut Composed Degree-Distance Realizations of Graphs 2022 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. Abstract Network realization problems require, given a specification $$\pi $$ for some network parameter (such as degrees, distances or connectivity), to construct a network G conforming to $$\pi $$, or to determine that no such network exists. In this paper we study composed profile realization, where the given instance consists of two or more profile specifications that need to be realized simultaneously. To gain some understanding of the problem, we focus on two classical profile types, namely, degrees and distances, which were (separately) studied extensively in the past. We investigate a wide spectrum of variants of the composed distance and degree realization problem. For each variant we either give a polynomial-time realization algorithm or establish NP hardness. In particular: We consider both precise specifications and range specifications, which specify a range of permissible values for each entry of the profile.We consider realizations by both weighted and unweighted graphs.We also study settings where the realizing graph is restricted to specific graph classes, including trees and bipartite graphs. Composed graph realization Degree realization Distance realization Graphic sequences Network design Peleg, David aut Perry, Mor aut Rawitz, Dror aut Enthalten in Algorithmica Springer US, 1986 85(2022), 3 vom: 08. Nov., Seite 665-687 (DE-627)129197564 (DE-600)53958-2 (DE-576)014456958 0178-4617 nnns volume:85 year:2022 number:3 day:08 month:11 pages:665-687 https://doi.org/10.1007/s00453-022-01055-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 GBV_ILN_2018 AR 85 2022 3 08 11 665-687 |
| allfieldsGer |
10.1007/s00453-022-01055-2 doi (DE-627)OLC2134275294 (DE-He213)s00453-022-01055-2-p DE-627 ger DE-627 rakwb eng 004 VZ 510 004 VZ Bar-Noy, Amotz verfasserin aut Composed Degree-Distance Realizations of Graphs 2022 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. Abstract Network realization problems require, given a specification $$\pi $$ for some network parameter (such as degrees, distances or connectivity), to construct a network G conforming to $$\pi $$, or to determine that no such network exists. In this paper we study composed profile realization, where the given instance consists of two or more profile specifications that need to be realized simultaneously. To gain some understanding of the problem, we focus on two classical profile types, namely, degrees and distances, which were (separately) studied extensively in the past. We investigate a wide spectrum of variants of the composed distance and degree realization problem. For each variant we either give a polynomial-time realization algorithm or establish NP hardness. In particular: We consider both precise specifications and range specifications, which specify a range of permissible values for each entry of the profile.We consider realizations by both weighted and unweighted graphs.We also study settings where the realizing graph is restricted to specific graph classes, including trees and bipartite graphs. Composed graph realization Degree realization Distance realization Graphic sequences Network design Peleg, David aut Perry, Mor aut Rawitz, Dror aut Enthalten in Algorithmica Springer US, 1986 85(2022), 3 vom: 08. Nov., Seite 665-687 (DE-627)129197564 (DE-600)53958-2 (DE-576)014456958 0178-4617 nnns volume:85 year:2022 number:3 day:08 month:11 pages:665-687 https://doi.org/10.1007/s00453-022-01055-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 GBV_ILN_2018 AR 85 2022 3 08 11 665-687 |
| allfieldsSound |
10.1007/s00453-022-01055-2 doi (DE-627)OLC2134275294 (DE-He213)s00453-022-01055-2-p DE-627 ger DE-627 rakwb eng 004 VZ 510 004 VZ Bar-Noy, Amotz verfasserin aut Composed Degree-Distance Realizations of Graphs 2022 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. Abstract Network realization problems require, given a specification $$\pi $$ for some network parameter (such as degrees, distances or connectivity), to construct a network G conforming to $$\pi $$, or to determine that no such network exists. In this paper we study composed profile realization, where the given instance consists of two or more profile specifications that need to be realized simultaneously. To gain some understanding of the problem, we focus on two classical profile types, namely, degrees and distances, which were (separately) studied extensively in the past. We investigate a wide spectrum of variants of the composed distance and degree realization problem. For each variant we either give a polynomial-time realization algorithm or establish NP hardness. In particular: We consider both precise specifications and range specifications, which specify a range of permissible values for each entry of the profile.We consider realizations by both weighted and unweighted graphs.We also study settings where the realizing graph is restricted to specific graph classes, including trees and bipartite graphs. Composed graph realization Degree realization Distance realization Graphic sequences Network design Peleg, David aut Perry, Mor aut Rawitz, Dror aut Enthalten in Algorithmica Springer US, 1986 85(2022), 3 vom: 08. Nov., Seite 665-687 (DE-627)129197564 (DE-600)53958-2 (DE-576)014456958 0178-4617 nnns volume:85 year:2022 number:3 day:08 month:11 pages:665-687 https://doi.org/10.1007/s00453-022-01055-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 GBV_ILN_2018 AR 85 2022 3 08 11 665-687 |
| language |
English |
| source |
Enthalten in Algorithmica 85(2022), 3 vom: 08. Nov., Seite 665-687 volume:85 year:2022 number:3 day:08 month:11 pages:665-687 |
| sourceStr |
Enthalten in Algorithmica 85(2022), 3 vom: 08. Nov., Seite 665-687 volume:85 year:2022 number:3 day:08 month:11 pages:665-687 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Composed graph realization Degree realization Distance realization Graphic sequences Network design |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Algorithmica |
| authorswithroles_txt_mv |
Bar-Noy, Amotz @@aut@@ Peleg, David @@aut@@ Perry, Mor @@aut@@ Rawitz, Dror @@aut@@ |
| publishDateDaySort_date |
2022-11-08T00:00:00Z |
| hierarchy_top_id |
129197564 |
| dewey-sort |
14 |
| id |
OLC2134275294 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">OLC2134275294</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230506162656.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230506s2022 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00453-022-01055-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2134275294</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00453-022-01055-2-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">Bar-Noy, Amotz</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Composed Degree-Distance Realizations of Graphs</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2022</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">© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Network realization problems require, given a specification $$\pi $$ for some network parameter (such as degrees, distances or connectivity), to construct a network G conforming to $$\pi $$, or to determine that no such network exists. In this paper we study composed profile realization, where the given instance consists of two or more profile specifications that need to be realized simultaneously. To gain some understanding of the problem, we focus on two classical profile types, namely, degrees and distances, which were (separately) studied extensively in the past. We investigate a wide spectrum of variants of the composed distance and degree realization problem. For each variant we either give a polynomial-time realization algorithm or establish NP hardness. In particular: We consider both precise specifications and range specifications, which specify a range of permissible values for each entry of the profile.We consider realizations by both weighted and unweighted graphs.We also study settings where the realizing graph is restricted to specific graph classes, including trees and bipartite graphs.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Composed graph realization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Degree realization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Distance realization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graphic sequences</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Network design</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Peleg, David</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Perry, Mor</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rawitz, Dror</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">85(2022), 3 vom: 08. Nov., Seite 665-687</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:85</subfield><subfield code="g">year:2022</subfield><subfield code="g">number:3</subfield><subfield code="g">day:08</subfield><subfield code="g">month:11</subfield><subfield code="g">pages:665-687</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00453-022-01055-2</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_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">85</subfield><subfield code="j">2022</subfield><subfield code="e">3</subfield><subfield code="b">08</subfield><subfield code="c">11</subfield><subfield code="h">665-687</subfield></datafield></record></collection>
|
| author |
Bar-Noy, Amotz |
| spellingShingle |
Bar-Noy, Amotz ddc 004 ddc 510 misc Composed graph realization misc Degree realization misc Distance realization misc Graphic sequences misc Network design Composed Degree-Distance Realizations of Graphs |
| authorStr |
Bar-Noy, Amotz |
| 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 Composed Degree-Distance Realizations of Graphs Composed graph realization Degree realization Distance realization Graphic sequences Network design |
| topic |
ddc 004 ddc 510 misc Composed graph realization misc Degree realization misc Distance realization misc Graphic sequences misc Network design |
| topic_unstemmed |
ddc 004 ddc 510 misc Composed graph realization misc Degree realization misc Distance realization misc Graphic sequences misc Network design |
| topic_browse |
ddc 004 ddc 510 misc Composed graph realization misc Degree realization misc Distance realization misc Graphic sequences misc Network design |
| 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 |
Composed Degree-Distance Realizations of Graphs |
| ctrlnum |
(DE-627)OLC2134275294 (DE-He213)s00453-022-01055-2-p |
| title_full |
Composed Degree-Distance Realizations of Graphs |
| author_sort |
Bar-Noy, Amotz |
| journal |
Algorithmica |
| journalStr |
Algorithmica |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works 500 - Science |
| recordtype |
marc |
| publishDateSort |
2022 |
| contenttype_str_mv |
txt |
| container_start_page |
665 |
| author_browse |
Bar-Noy, Amotz Peleg, David Perry, Mor Rawitz, Dror |
| container_volume |
85 |
| class |
004 VZ 510 004 VZ |
| format_se |
Aufsätze |
| author-letter |
Bar-Noy, Amotz |
| doi_str_mv |
10.1007/s00453-022-01055-2 |
| dewey-full |
004 510 |
| title_sort |
composed degree-distance realizations of graphs |
| title_auth |
Composed Degree-Distance Realizations of Graphs |
| abstract |
Abstract Network realization problems require, given a specification $$\pi $$ for some network parameter (such as degrees, distances or connectivity), to construct a network G conforming to $$\pi $$, or to determine that no such network exists. In this paper we study composed profile realization, where the given instance consists of two or more profile specifications that need to be realized simultaneously. To gain some understanding of the problem, we focus on two classical profile types, namely, degrees and distances, which were (separately) studied extensively in the past. We investigate a wide spectrum of variants of the composed distance and degree realization problem. For each variant we either give a polynomial-time realization algorithm or establish NP hardness. In particular: We consider both precise specifications and range specifications, which specify a range of permissible values for each entry of the profile.We consider realizations by both weighted and unweighted graphs.We also study settings where the realizing graph is restricted to specific graph classes, including trees and bipartite graphs. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. |
| abstractGer |
Abstract Network realization problems require, given a specification $$\pi $$ for some network parameter (such as degrees, distances or connectivity), to construct a network G conforming to $$\pi $$, or to determine that no such network exists. In this paper we study composed profile realization, where the given instance consists of two or more profile specifications that need to be realized simultaneously. To gain some understanding of the problem, we focus on two classical profile types, namely, degrees and distances, which were (separately) studied extensively in the past. We investigate a wide spectrum of variants of the composed distance and degree realization problem. For each variant we either give a polynomial-time realization algorithm or establish NP hardness. In particular: We consider both precise specifications and range specifications, which specify a range of permissible values for each entry of the profile.We consider realizations by both weighted and unweighted graphs.We also study settings where the realizing graph is restricted to specific graph classes, including trees and bipartite graphs. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. |
| abstract_unstemmed |
Abstract Network realization problems require, given a specification $$\pi $$ for some network parameter (such as degrees, distances or connectivity), to construct a network G conforming to $$\pi $$, or to determine that no such network exists. In this paper we study composed profile realization, where the given instance consists of two or more profile specifications that need to be realized simultaneously. To gain some understanding of the problem, we focus on two classical profile types, namely, degrees and distances, which were (separately) studied extensively in the past. We investigate a wide spectrum of variants of the composed distance and degree realization problem. For each variant we either give a polynomial-time realization algorithm or establish NP hardness. In particular: We consider both precise specifications and range specifications, which specify a range of permissible values for each entry of the profile.We consider realizations by both weighted and unweighted graphs.We also study settings where the realizing graph is restricted to specific graph classes, including trees and bipartite graphs. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 GBV_ILN_2018 |
| container_issue |
3 |
| title_short |
Composed Degree-Distance Realizations of Graphs |
| url |
https://doi.org/10.1007/s00453-022-01055-2 |
| remote_bool |
false |
| author2 |
Peleg, David Perry, Mor Rawitz, Dror |
| author2Str |
Peleg, David Perry, Mor Rawitz, Dror |
| ppnlink |
129197564 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s00453-022-01055-2 |
| up_date |
2024-07-04T00:20:58.187Z |
| _version_ |
1803605726406377472 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">OLC2134275294</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230506162656.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230506s2022 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00453-022-01055-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2134275294</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00453-022-01055-2-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">Bar-Noy, Amotz</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Composed Degree-Distance Realizations of Graphs</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2022</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">© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Network realization problems require, given a specification $$\pi $$ for some network parameter (such as degrees, distances or connectivity), to construct a network G conforming to $$\pi $$, or to determine that no such network exists. In this paper we study composed profile realization, where the given instance consists of two or more profile specifications that need to be realized simultaneously. To gain some understanding of the problem, we focus on two classical profile types, namely, degrees and distances, which were (separately) studied extensively in the past. We investigate a wide spectrum of variants of the composed distance and degree realization problem. For each variant we either give a polynomial-time realization algorithm or establish NP hardness. In particular: We consider both precise specifications and range specifications, which specify a range of permissible values for each entry of the profile.We consider realizations by both weighted and unweighted graphs.We also study settings where the realizing graph is restricted to specific graph classes, including trees and bipartite graphs.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Composed graph realization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Degree realization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Distance realization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graphic sequences</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Network design</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Peleg, David</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Perry, Mor</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rawitz, Dror</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">85(2022), 3 vom: 08. Nov., Seite 665-687</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:85</subfield><subfield code="g">year:2022</subfield><subfield code="g">number:3</subfield><subfield code="g">day:08</subfield><subfield code="g">month:11</subfield><subfield code="g">pages:665-687</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00453-022-01055-2</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_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">85</subfield><subfield code="j">2022</subfield><subfield code="e">3</subfield><subfield code="b">08</subfield><subfield code="c">11</subfield><subfield code="h">665-687</subfield></datafield></record></collection>
|
| score |
7.4017067 |