Composed Degree-Distance Realizations of Graphs

Amotz Bar-Noy, David Peleg, Mor Perry, Dror Rawitz

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 languageEnglish
Title of host publicationCombinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Proceedings
EditorsPaola Flocchini, Lucia Moura
PublisherSpringer Science and Business Media Deutschland GmbH
Pages63-77
Number of pages15
ISBN (Print)9783030799861
DOIs
StatePublished - 2021
Externally publishedYes
Event32nd International Workshop on Combinatorial Algorithms, IWOCA 2021 - Virtual, Online
Duration: 5 Jul 20217 Jul 2021

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12757 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference32nd International Workshop on Combinatorial Algorithms, IWOCA 2021
CityVirtual, Online
Period5/07/217/07/21

Fingerprint

Dive into the research topics of 'Composed Degree-Distance Realizations of Graphs'. Together they form a unique fingerprint.

Cite this