Clique-Width is NP-Complete

Article Properties
Cite
Fellows, Michael R., et al. “Clique-Width Is NP-Complete”. SIAM Journal on Discrete Mathematics, vol. 23, no. 2, 2009, pp. 909-3, https://doi.org/10.1137/070687256.
Fellows, M. R., Rosamond, F. A., Rotics, U., & Szeider, S. (2009). Clique-Width is NP-Complete. SIAM Journal on Discrete Mathematics, 23(2), 909-939. https://doi.org/10.1137/070687256
Fellows, Michael R., Frances A. Rosamond, Udi Rotics, and Stefan Szeider. “Clique-Width Is NP-Complete”. SIAM Journal on Discrete Mathematics 23, no. 2 (2009): 909-39. https://doi.org/10.1137/070687256.
Fellows MR, Rosamond FA, Rotics U, Szeider S. Clique-Width is NP-Complete. SIAM Journal on Discrete Mathematics. 2009;23(2):909-3.
Journal Categories
Science
Mathematics
Technology
Engineering (General)
Civil engineering (General)
Technology
Technology (General)
Industrial engineering
Management engineering
Applied mathematics
Quantitative methods
Refrences
Title Journal Journal Categories Citations Publication Date
Title 1998
10.1016/0304-3975(93)90064-Z
10.1007/BF01204169
10.1137/S0097539701385351
Clique-Width for 4-Vertex Forbidden Subgraphs Theory of Computing Systems
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
35 2006
Citations
Title Journal Journal Categories Citations Publication Date
Succinct data structures for bounded clique-width graphs Discrete Applied Mathematics
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Technology: Engineering (General). Civil engineering (General)
2024
Three remarks on W graphs Theoretical Computer Science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
2024
Stability, Vertex Stability, and Unfrozenness for Special Graph Classes

Theory of Computing Systems
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
2023
Fair allocation algorithms for indivisible items under structured conflict constraints

Computational and Applied Mathematics
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
2023
On the computational difficulty of the terminal connection problem

RAIRO - Theoretical Informatics and Applications
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
2023
Citations Analysis
The category Science: Mathematics 31 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Graphs of linear clique-width at most 3 and was published in 2011. The most recent citation comes from a 2024 study titled Succinct data structures for bounded clique-width graphs. This article reached its peak citation in 2015, with 8 citations. It has been cited in 21 different journals, 9% of which are open access. Among related journals, the Discrete Applied Mathematics cited this research the most, with 13 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year