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 "efficient enumeration of bipartite subgraphs in graphs"):
  Abstract: Subgraph enumeration problems ask to output all subgraphs of an input graph that belong to a specified graph class or satisfy a given constraint. These problems have been widely studied in theoretical computer science. So far, many efficient enumeration algorithms for the fundamental substructures such as spanning trees, cycles, and paths, have been developed. This paper addresses the enumeration problem of bipartite subgraphs. Even though bipartite graphs are quite fundamental and have numerous applications in both theory and practice, their enumeration algorithms have not been intensively studied, to the best of our knowledge. We propose the first non-trivial algorithms for enumerating all bipartite subgraphs in a given graph. As the main results, we develop two efficient algorithms: the one enumerates all bipartite induced subgraphs of a graph with degeneracy k in \(\mathcal {O}\left( k\right) \) time per solution. The other enumerates all bipartite subgraphs in \(\mathcal {O}\left( 1\right) \) time per solution.

Includes members:
  Member "enumeration of enumeration algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "constant delay enumeration for nondeterministic document spanners")
  Member "efficient enumeration of induced subtrees in a k degenerate graph":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "constant amortized time enumeration of independent sets for graphs with bounded clique number")
  Member "optimal listing of cycles and st paths in undirected graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "efficient enumeration of dominating sets for sparse graphs")
  Member "listing all maximal cliques in large sparse real world graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "shared memory parallel maximal clique enumeration from static and dynamic graphs")
  Member "listing all maximal cliques in sparse graphs in near optimal time":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "teaser fast and certifiable point cloud registration")

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)