Work

Complexity and algorithms for constant diameter augmentation problems

Year: 2020

Type: preprint

Abstract: We study the following problem: for given integers $d,k$ and graph $G$, can we obtain a graph with diameter $d$ via at most $k$ edge deletions ? We determine the computational complexity of this and related problems for different values of $d$.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2010.00273

Authors: Kim, Eun Jung, Milanic, Martin, Monnot, Jérôme, Picouleau, Christophe

Institutions: Université Paris Dauphine-PSL, University of Primorska, Conservatoire National des Arts et Métiers, Centre d'études et de recherche en informatique et communications

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Javna Agencija za Raziskovalno Dejavnost RS

Awards: Topological and Algebraic Combinatorics, The infrastructure group at University of Primorska, Topics in structural graph teory: invariants, separators and intersection representations, Algebra, discrete mathematics, probability and game theory, Traversability in vertex-transitive graphs

OpenAlex ID: W4287645702

Cites:

Cited by:

Related to: 10