Complexity Results for Generating Subgraphs

Article Properties
Cite
Levit, Vadim E., and David Tankus. “Complexity Results for Generating Subgraphs”. Algorithmica, vol. 80, no. 8, 2017, pp. 2384-99, https://doi.org/10.1007/s00453-017-0325-1.
Levit, V. E., & Tankus, D. (2017). Complexity Results for Generating Subgraphs. Algorithmica, 80(8), 2384-2399. https://doi.org/10.1007/s00453-017-0325-1
Levit, Vadim E., and David Tankus. “Complexity Results for Generating Subgraphs”. Algorithmica 80, no. 8 (2017): 2384-99. https://doi.org/10.1007/s00453-017-0325-1.
Levit VE, Tankus D. Complexity Results for Generating Subgraphs. Algorithmica. 2017;80(8):2384-99.
Journal Categories
Science
Mathematics
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Technology
Engineering (General)
Civil engineering (General)
Technology
Technology (General)
Industrial engineering
Management engineering
Applied mathematics
Quantitative methods
You May Also Like
Refrences
Title Journal Journal Categories Citations Publication Date
Weighted well-covered claw-free graphs Discrete Mathematics
  • Science: Mathematics
 9 2015
Well-covered graphs without cycles of lengths 4, 5 and 6 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)
 7 2015
On relating edges in graphs without cycles of length 4 Journal of Discrete Algorithms 7 2014
Weighted well-covered graphs without C4, C5, C6, C7 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)
 7 2011
The structure of well-covered graphs with no cycles of length 4 Discrete Mathematics
  • Science: Mathematics
 14 2007
Refrences Analysis
Category Category Repetition
Science: Mathematics12
Technology: Engineering (General). Civil engineering (General)10
Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods4
Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware2
Technology: Manufactures: Production management. Operations management2
Science: Mathematics: Instruments and machines: Electronic computers. Computer science2
The category Science: Mathematics 12 is the most frequently represented among the references in this article. It primarily includes studies from SIAM Journal on Discrete Mathematics and Discrete Mathematics. The chart below illustrates the number of referenced publications per year.
Refrences used by this article by year
Citations
Title Journal Journal Categories Citations Publication Date
Well-Covered Graphs With Constraints On $$\Delta $$ And $$\delta $$ 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
Weighted well-covered graphs without cycles of lengths 5, 6 and 7 Information Processing Letters
  • Technology: Technology (General): Industrial engineering. Management engineering: Information technology
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Telecommunication
  • Science: Science (General): Cybernetics: Information theory
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 2022
Recognizing Generating Subgraphs Revisited

 International Journal of Foundations of 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
 2021
Recognizing generating subgraphs in graphs without cycles of lengths 6 and 7 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)
 2 2020
Citations Analysis
Category Category Repetition
Science: Mathematics: Instruments and machines: Electronic computers. Computer science3
Science: Mathematics2
Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software2
Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware2
Technology: Engineering (General). Civil engineering (General)1
Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods1
Technology: Technology (General): Industrial engineering. Management engineering: Information technology1
Technology: Electrical engineering. Electronics. Nuclear engineering: Telecommunication1
Science: Science (General): Cybernetics: Information theory1
The category Science: Mathematics: Instruments and machines: Electronic computers. Computer science 3 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Recognizing generating subgraphs in graphs without cycles of lengths 6 and 7 and was published in 2020. The most recent citation comes from a 2023 study titled Well-Covered Graphs With Constraints On $$\Delta $$ And $$\delta $$. This article reached its peak citation in 2023, with 1 citations. It has been cited in 4 different journals. Among related journals, the Theory of Computing Systems cited this research the most, with 1 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year