Sparse Graphs and an Augmentation Problem
From MaRDI portal
Publication:5041749
DOI10.1007/978-3-030-45771-6_19zbMath1503.90112OpenAlexW3213735652MaRDI QIDQ5041749
Publication date: 14 October 2022
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-45771-6_19
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Augmenting the rigidity of a graph in \(\mathbb R^{2}\)
- Generic global rigidity of body-hinge frameworks
- Brick partitions of graphs
- On matroidal families
- An algorithm for two-dimensional rigidity percolation: The pebble game
- Combined connectivity augmentation and orientation problems
- Sparse graphs and an augmentation problem
- Global rigidity of generic frameworks on the cylinder
- Pebble game algorithms and sparse graphs
- On graphs and rigidity of plane skeletal structures
- Linking (n-2)-dimensional panels in n-space. II: (n-2,2)-frameworks and body and Hinge structures
- Development of redundant rigidity theory for formation control
- The Union of Matroids and the Rigidity of Frameworks
- Conditions for Unique Graph Realizations
- Augmentation Problems
- On the hardness of approximating minimization problems
- Rigidity of Frameworks Supported on Surfaces
- Decomposition of Finite Graphs Into Forests
- Algorithms - ESA 2003
This page was built for publication: Sparse Graphs and an Augmentation Problem
