Reconfiguration of graphs with connectivity constraints
From MaRDI portal
Publication:1757779
DOI10.1007/978-3-030-04693-4_18OpenAlexW2889701910MaRDI QIDQ1757779FDOQ1757779
Authors: Nicolas Bousquet, Arnaud Mary 
Publication date: 15 January 2019
Full work available at URL: https://arxiv.org/abs/1809.05443
Recommendations
- Reconfigurations in Graphs and Grids
- Reconfigurations in Graphs and Grids
- Reconfiguration of connected graph partitions
- Reconfiguration on sparse graphs
- Reconfiguration on sparse graphs
- 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)
- Reconfiguring spanning and induced subgraphs
- Reconfiguration of graphs with connectivity constraints
- Reconfigurations in Graphs and Grids
- Reconfiguration on nowhere dense graph classes
- Algorithm Theory - SWAT 2004
- Title not available (Why is that?)
- Approximating Shortest Connected Graph Transformation for Trees
- Reconfiguration of connected graph partitions via recombination
- Reconfiguration on sparse graphs
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)
