Intersection of Longest Paths in Graph Theory and Predicting Performance in Facial Recognition

@inproceedings{Yates2017IntersectionOL,
  title={Intersection of Longest Paths in Graph Theory and Predicting Performance in Facial Recognition},
  author={Amy Yates},
  year={2017}
}
A set of subsets is said to have the Helly property if the condition that each pair of subsets has a non-empty intersection implies that the intersection of all subsets has a nonempty intersection. In 1966, Gallai noticed that the set of all longest paths of a connected graph is pairwise intersecting and asked if the set had the Helly property. While it is not true in general, a number of classes of graphs have been shown to have the property. In this dissertation, we show that K4-minor-free… CONTINUE READING

Figures from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 68 REFERENCES

Report on the FG 2015 Video Person Recognition Evaluation

  • 2015 11th IEEE International Conference and Workshops on Automatic Face and Gesture Recognition (FG)
  • 2015
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Planar Lattice Graphs with Gallai’s Property

  • Graphs and Combinatorics
  • 2013
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

SNoW: Understanding the causes of strong, neutral, and weak face impostor pairs

  • 2013 IEEE Sixth International Conference on Biometrics: Theory, Applications and Systems (BTAS)
  • 2013
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

Partial characterizations of clique-perfect graphs ii: Diamond-free and helly circular-arc graphs

F. Bonomo, M. Chudnovsky, G. Durn
  • Discrete Mathematics, vol. 309, no. 11, pp. 3485 – 3499, 2009, 7th International Colloquium on Graph TheoryICGT 05. [Online]. Available: http://www.sciencedirect.com/science/article/ pii/S0012365X07010527
  • 2009
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Longest Paths in Circular Arc Graphs

  • Combinatorics, Probability & Computing
  • 2004
VIEW 8 EXCERPTS
HIGHLY INFLUENTIAL