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 "finding hamiltonian and longest s t paths of c shaped supergrid graphs in linear time"):
  Abstract: A supergrid graph is a finite vertex-induced subgraph of the infinite graph whose vertex set consists of all points of the plane with integer coordinates and in which two vertices are adjacent if the difference of their x or y coordinates is not larger than 1. The Hamiltonian path (cycle) problem is to determine whether a graph contains a simple path (cycle) in which each vertex of the graph appears exactly once. This problem is NP-complete for general graphs and it is also NP-complete for general supergrid graphs. Despite the many applications of the problem, it is still open for many classes, including solid supergrid graphs and supergrid graphs with some holes. A graph is called Hamiltonian connected if it contains a Hamiltonian path between any two distinct vertices. In this paper, first we will study the Hamiltonian cycle property of C-shaped supergrid graphs, which are a special case of rectangular supergrid graphs with a rectangular hole. Next, we will show that C-shaped supergrid graphs are Hamiltonian connected except few conditions. Finally, we will compute a longest path between two distinct vertices in these graphs. The Hamiltonian connectivity of C-shaped supergrid graphs can be applied to compute the optimal stitching trace of computer embroidery machines, and construct the minimum printing trace of 3D printers with a C-like component being printed.

Includes members:
  Member "hamiltonian cycles in linear convex supergrid graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the hamiltonicity hamiltonian connectivity and longest s t path of l shaped supergrid graphs")
  Member "an efficient parallel algorithm for the longest path problem in meshes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the hamiltonicity hamiltonian connectivity and longest s t path of l shaped supergrid graphs")

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.CC(Computational Complexity)