Reconfiguration of graphs with connectivity constraints

DOI10.1007/978-3-030-04693-4_18MaRDI QIDQ1757779zbMATH OpenOpenAlexFDO

Authors Nicolas Bousquet, Arnaud Mary

Publication date 15 January 2019

Full work available at URL https://arxiv.org/abs/1809.05443

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Approximation algorithms (68W25)

Recommendations

• Reconfigurations in Graphs and Grids
• Reconfigurations in Graphs and Grids
• Reconfiguration of connected graph partitions
• Reconfiguration of connected graph partitions via recombination
• Reconfiguration of connected graph partitions via recombination
• On the connectivity of configuration graphs
• Reconfiguration graphs for dominating sets
• Reconfiguration graphs of shortest paths

Cited in

(9)

• Reconfigurations in Graphs and Grids
• Reconfiguration on nowhere dense graph classes
• Algorithm Theory - SWAT 2004
• Approximating shortest connected graph transformation for trees
• scientific article; zbMATH DE number 7525461 (Why is no real title available?)
• Reconfiguration of graphs with connectivity constraints
• Reconfiguration of connected graph partitions via recombination
• Reconfiguration of graph minors
• Degree-constrained subgraph reconfiguration is in P

This page was built for publication: Reconfiguration of graphs with connectivity constraints

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