Sparse graphs and an augmentation problem

DOI10.1007/S10107-021-01689-0MaRDI QIDQ2118121zbMATH OpenOpenAlexFDO

Authors Csaba Király, András Mihálykó

Publication date 22 March 2022

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10107-021-01689-0

zbMATH Keywords

augmentationcount matroidrigiditysparse graphs

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Density (toughness, etc.) (05C42) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Sparse graphs and an augmentation problem
• Augmenting the rigidity of a graph in \(\mathbb R^{2}\)
• Globally rigid augmentation of rigid graphs
• scientific article; zbMATH DE number 1617267
• A minimum 3-connectivity augmentation of a graph

Cites work

• Algorithms for graph rigidity and scene analysis
• An algorithm for two-dimensional rigidity percolation: The pebble game
• Augmentation Problems
• Augmenting the rigidity of a graph in \(\mathbb R^{2}\)
• Brick partitions of graphs
• Combinatorial rigidity. Graphs and matroids in the theory of rigid frameworks
• Combined connectivity augmentation and orientation problems
• Conditions for Unique Graph Realizations
• Connections in combinatorial optimization
• Decomposition of Finite Graphs Into Forests
• Development of redundant rigidity theory for formation control
• Generic global rigidity of body-hinge frameworks
• Global rigidity of generic frameworks on the cylinder
• scientific article; zbMATH DE number 30657 (Why is no real title available?)
• scientific article; zbMATH DE number 952952 (Why is no real title available?)
• Minimum cost globally rigid subgraphs
• On graphs and rigidity of plane skeletal structures
• On matroidal families
• On the hardness of approximating minimization problems
• Pebble game algorithms and sparse graphs
• Rigidity of Frameworks Supported on Surfaces
• Sparse hypergraphs and pebble game algorithms

Cited in

(5)

• scientific article; zbMATH DE number 2185598 (Why is no real title available?)
• Sparse graphs and an augmentation problem
• Globally rigid augmentation of rigid graphs
• Augmenting the rigidity of a graph in \(\mathbb R^{2}\)
• On finding augmenting graphs

This page was built for publication: Sparse graphs and an augmentation problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118121)