# Fast Diameter Computation within Split Graphs

@inproceedings{Ducoffe2019FastDC, title={Fast Diameter Computation within Split Graphs}, author={Guillaume Ducoffe and Michel Habib and Laurent Viennot}, booktitle={COCOA}, year={2019} }

When can we compute the diameter of a graph in quasi linear time? We address this question for the class of split graphs, that we observe to be the hardest instances for deciding whether the diameter is at most two. We stress that although the diameter of a non-complete split graph can only be either 2 or 3, under the Strong Exponential-Time Hypothesis (SETH) we cannot compute the diameter of a split graph in less than quadratic time. Therefore it is worth to study the complexity of diameter… CONTINUE READING

#### Citations

##### Publications citing this paper.

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 36 REFERENCES

## Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs

VIEW 7 EXCERPTS

HIGHLY INFLUENTIAL

## Quasi-optimal range searching in spaces of finite VC-dimension

VIEW 3 EXCERPTS

HIGHLY INFLUENTIAL

## Rooted directed path graphs are leaf powers

VIEW 1 EXCERPT