Sparse graphs and an augmentation problem
type: Item
instance of: scholarly article
title: Sparse graphs and an augmentation problem
zbMATH Open document ID: 1485.05093
author: Csaba Király
author: András Mihálykó
published in: Mathematical Programming. Series A. Series B
publication date: 2022-03-22T00:00:00Z
Mathematics Subject Classification ID: 05C42
Mathematics Subject Classification ID: 05B35
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 7495415
zbMATH Keywords: augmentation
zbMATH Keywords: sparse graphs
zbMATH Keywords: rigidity
zbMATH Keywords: count matroid
MaRDI profile type: Publication
full work available at URL: s10107-021-01689-0
OpenAlex ID: W3017154438
cites work: Algorithms - ESA 2003
cites work: Augmentation Problems
cites work: Q3085455
cites work: Combined connectivity augmentation and orientation problems
cites work: Augmenting the rigidity of a graph in \(\mathbb R^{2}\)
cites work: Conditions for Unique Graph Realizations
cites work: Brick partitions of graphs
cites work: Global rigidity of generic frameworks on the cylinder
cites work: An algorithm for two-dimensional rigidity percolation: The pebble game
cites work: Q2990097
cites work: Generic global rigidity of body-hinge frameworks
cites work: Minimum Cost Globally Rigid Subgraphs
cites work: On graphs and rigidity of plane skeletal structures
cites work: Pebble game algorithms and sparse graphs
cites work: On matroidal families
cites work: On the hardness of approximating minimization problems
cites work: Decomposition of Finite Graphs Into Forests
cites work: Rigidity of Frameworks Supported on Surfaces
cites work: Sparse hypergraphs and pebble game algorithms
cites work: Q3986938
cites work: Q4717849
cites work: Development of redundant rigidity theory for formation control
DOI: 10.1007/S10107-021-01689-0
description: scientific article