A Dynamic Programming Approach to the Dominating Set Problem on k-Trees

Article Properties
Refrences
Title Journal Journal Categories Citations Publication Date
Algorithmic graph theory and perfect graphs 1980
Computers and intractability 1979
10.1016/0166-218X(83)90003-3
Decomposing a Polygon into Simpler Components SIAM Journal on Computing
  • 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
 63 1985
Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph SIAM Journal on Computing
  • 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
 236 1972
Citations
Title Journal Journal Categories Citations Publication Date
Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications Algorithmica
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
 6 2011
Upper and lower bounds for finding connected motifs in vertex-colored graphs Journal of Computer and System Sciences
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • 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
 28 2011
SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS

 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
 2005
Using a hybrid of exact and genetic algorithms to design survivable networks Computers & Operations Research
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Technology: Technology (General): Industrial engineering. Management engineering: Information technology
  • Technology: Manufactures: Production management. Operations management
  • Technology: Technology (General): Industrial engineering. Management engineering
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 2002
Algorithms for Vertex Partitioning Problems on Partial k-Trees SIAM Journal on Discrete Mathematics
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Technology: Engineering (General). Civil engineering (General)
 1997
Citations Analysis
Category Category Repetition
Science: Mathematics13
Technology: Engineering (General). Civil engineering (General)11
Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods10
Science: Mathematics: Instruments and machines: Electronic computers. Computer science4
Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software3
Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware2
Technology: Technology (General): Industrial engineering. Management engineering: Information technology2
Technology: Manufactures: Production management. Operations management2
Technology: Electrical engineering. Electronics. Nuclear engineering: Telecommunication1
Science: Science (General): Cybernetics: Information theory1
Technology: Technology (General): Industrial engineering. Management engineering1
The category Science: Mathematics 13 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Complexity of Finding Embeddings in a k-Tree and was published in 1987. The most recent citation comes from a 2011 study titled Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications. This article reached its peak citation in 1993, with 3 citations. It has been cited in 10 different journals. Among related journals, the Discrete Applied Mathematics cited this research the most, with 7 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year