human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "a story of diameter radius and helly property"):
  Abstract: A graph is Helly if every family of pairwise intersecting balls has a nonempty common intersection. Motivated by previous work on dually chordal graphs and graphs of bounded distance VC-dimension (with the former being a subclass of Helly graphs and the latter being a particular case of graphs of bounded fractional Helly number, respectively) we prove several new results on the complexity of computing the diameter and the radius on Helly graphs and related graph classes. #R##N#* First, we present an algorithm which given an $n$-vertex $m$-edge Helly graph $G$ as input, computes w.h.p. $rad(G)$ in time $\tilde{\cal O}(m\sqrt{n})$. Incidentally, it also gives us an additive $+1$-approximation of $diam(G)$. #R##N#* Then, we focus on $C_4$-free Helly graphs, which include, amongst other subclasses, bridged Helly graphs and so, chordal Helly graphs and hereditary Helly graphs. For the $C_4$-free Helly graphs, we present linear-time algorithms for computing the eccentricity of all vertices. Doing so, we generalize previous results on strongly chordal graphs to a much larger subclass. #R##N#* Finally, we derive from our findings on chordal Helly graphs a more general one-to-many reduction from diameter computation on chordal graphs to either diameter computation on split graphs or the Disjoint Set problem. Therefore, split graphs are in some sense the only hard instances for diameter computation on chordal graphs. As a byproduct of our reduction we get that on any subclass of chordal graphs with constant VC-dimension the diameter can be computed in truly subquadratic time. #R##N#These above results are a new step toward better understanding the role of abstract geometric properties in the fast computation of metric graph invariants.

Includes members:
  Member "diameter computation on h minor free graphs and graphs of bounded distance vc dimension":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fast diameter computation within split graphs")
  Member "fast diameter computation within split graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "diameter computation on h minor free graphs and graphs of bounded distance vc dimension")
  Member "multivariate analysis of orthogonal range searching and graph distances parameterized by treewidth":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "diameter computation on h minor free graphs and graphs of bounded distance vc dimension")
  Member "fully polynomial fpt algorithms for some classes of bounded clique width graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "iterated type partitions")
  Member "voronoi diagrams on planar graphs and computing the diameter in deterministic tilde o n 5 3 time":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "planar diameter via metric compression")
  Member "subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "planar diameter via metric compression")
  Member "identifying codes in hereditary classes of graphs and vc dimension":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "diameter computation on h minor free graphs and graphs of bounded distance vc dimension")
  Member "covering nearly surface embedded graphs with a fixed number of balls":
    also connected through other hyperedges:
      (none)

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.DS(Data Structures and Algorithms)