Abstract
Network realization problems require, given a specification for some network parameter (such as degrees, distances or connectivity), to construct a network G conforming to, 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 & 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.
Original language | English |
---|---|
Title of host publication | Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Proceedings |
Editors | Paola Flocchini, Lucia Moura |
Publisher | Springer Science and Business Media Deutschland GmbH |
Pages | 63-77 |
Number of pages | 15 |
ISBN (Print) | 9783030799861 |
DOIs | |
State | Published - 2021 |
Event | 32nd International Workshop on Combinatorial Algorithms, IWOCA 2021 - Virtual, Online Duration: 5 Jul 2021 → 7 Jul 2021 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 12757 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 32nd International Workshop on Combinatorial Algorithms, IWOCA 2021 |
---|---|
City | Virtual, Online |
Period | 5/07/21 → 7/07/21 |
Bibliographical note
Publisher Copyright:© 2021, Springer Nature Switzerland AG.
Funding
Supported in part by a US-Israel BSF grant (2018043). 1 We consider profile types for which Π(G) is polynomial-time computable given G.
Funders | Funder number |
---|---|
US-Israel BSF | 2018043 |