# Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth

@article{Kurita2018EfficientEO, title={Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth}, author={Kazuhiro Kurita and Kunihiro Wasa and Alessio Conte and Hiroki Arimura and Takeaki Uno}, journal={ArXiv}, year={2018}, volume={abs/1806.04307} }

The girth of a graph is the length of its shortest cycle. Due to its relevance in graph theory, network analysis and practical fields such as distributed computing, girth-related problems have been object of attention in both past and recent literature. In this paper, we consider the problem of listing connected subgraphs with bounded girth. As a large girth is index of sparsity, this allows to extract sparse structures from the input graph. We propose two algorithms, for enumerating… CONTINUE READING

#### Supplemental Presentations

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 15 REFERENCES

## Computing the Girth of a Planar Graph in Linear Time

VIEW 1 EXCERPT

## A High Girth Graph Construction

VIEW 1 EXCERPT

## A new series of dense graphs of high girth

VIEW 1 EXCERPT