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 meta algorithm for solving connectivity and acyclicity constraints on locally checkable properties parameterized by graph width measures"):
  Abstract: In this paper, we design a framework to obtain efficient algorithms for several problems with a global constraint (acyclicity or connectivity) such as Connected Dominating Set, Node Weighted Steiner Tree, Maximum Induced Tree, Longest Induced Path, and Feedback Vertex Set.  #R##N#We design a meta-algorithm that solves all these problems and whose running time is upper bounded by  $2^{O(k)}\cdot n^{O(1)}$, $2^{O(k \log(k))}\cdot n^{O(1)}$, $2^{O(k^2)}\cdot n^{O(1)}$ and $n^{O(k)}$ where $k$ is respectively the clique-width, $\mathbb{Q}$-rank-width, rank-width and maximum induced matching width of a given decomposition.#R##N#Our meta-algorithm simplifies and unifies the known algorithms for each of the parameters and its running time matches asymptotically also the running times of the best known algorithms for basic NP-hard problems such as Vertex Cover and Dominating Set.#R##N#Our framework is based on the $d$-neighbor equivalence defined in [Bui-Xuan, Telle and Vatshelle, TCS 2013].#R##N#The results we obtain highlight the importance of this equivalence relation on the algorithmic applications of width measures. #R##N##R##N#We also prove that our framework could be useful for $W[1]$-hard problems parameterized by clique-width such as Max Cut and Maximum Minimal Cut.#R##N#For these latter problems, we obtain $n^{O(k)}$, $n^{O(k)}$ and $n^{2^{O(k)}}$ time algorithms where $k$ is respectively the clique-width, the $\mathbb{Q}$-rank-width and the rank-width of the input graph.

Includes members:
  Member "node multiway cut and subset feedback vertex set on graphs of bounded mim width":
    also connected through other hyperedges:
      (none)
  Member "computing the largest bond of a graph":
    also connected through other hyperedges:
      (none)
  Member "fast exact algorithms for some connectivity problems parametrized by clique width":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "hamiltonian cycle parameterized by treedepth in single exponential time and polynomial space")
  Member "a unified polynomial time algorithm for feedback vertex set on graphs of bounded mim width":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "measuring what matters a hybrid approach to dynamic programming with treewidth")
  Member "generalized feedback vertex set problems on bounded treewidth graphs chordality is the key to single exponential parameterized algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a complexity dichotomy for hitting connected minors on bounded treewidth graphs the chair and the banner draw the boundary")
  Member "polynomial time algorithms for the longest induced path and induced disjoint paths problems on graphs of bounded mim width":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "linear mim width of trees")
  Member "on distance d independent set and other problems in graphs with few minimal separators":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "potential maximal cliques parameterized by edge clique cover")
  Member "output polynomial enumeration on graphs of bounded local linear mim width":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "linear mim width of trees")

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)