DeepAI AI Chat
Log In Sign Up

Reconfiguring spanning and induced subgraphs

by   Tesshu Hanaka, et al.
University of Waterloo
Tohoku University

Subgraph reconfiguration is a family of problems focusing on the reachability of the solution space in which feasible solutions are subgraphs, represented either as sets of vertices or sets of edges, satisfying a prescribed graph structure property. Although there has been previous work that can be categorized as subgraph reconfiguration, most of the related results appear under the name of the property under consideration; for example, independent set, clique, and matching. In this paper, we systematically clarify the complexity status of subgraph reconfiguration with respect to graph structure properties.


page 1

page 2

page 3

page 4


Finding Connected Secluded Subgraphs

Problems related to finding induced subgraphs satisfying given propertie...

On density of subgraphs of halved cubes

Let S be a family of subsets of a set X of cardinality m and VC-dim( S)...

Finding induced subgraphs in scale-free inhomogeneous random graphs

We study the induced subgraph isomorphism problem on inhomogeneous rando...

On different Versions of the Exact Subgraph Hierarchy for the Stable Set Problem

One of many different hierarchies towards the stability number of a grap...

Computing Dense and Sparse Subgraphs of Weakly Closed Graphs

A graph G is weakly γ-closed if every induced subgraph of G contains one...

DSL: Discriminative Subgraph Learning via Sparse Self-Representation

The goal in network state prediction (NSP) is to classify the global sta...

Subgraph nomination: Query by Example Subgraph Retrieval in Networks

This paper introduces the subgraph nomination inference task, in which e...