Intersection of Longest Paths in Graph Theory and Predicting Performance in Facial Recognition
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 non-empty intersection. In 1966, Gallai noticed that the set of all longest paths of a connected graph is pairwise intersecti...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
ScholarWorks @ Georgia State University
2017
|
| Subjects: | |
| Online Access: | http://scholarworks.gsu.edu/math_diss/34 http://scholarworks.gsu.edu/cgi/viewcontent.cgi?article=1037&context=math_diss |