A Separator Theorem for Chordal Graphs

Article Properties
Cite
Gilbert, John R., et al. “A Separator Theorem for Chordal Graphs”. SIAM Journal on Algebraic Discrete Methods, vol. 5, no. 3, 1984, pp. 306-13, https://doi.org/10.1137/0605032.
Gilbert, J. R., Rose, D. J., & Edenbrandt, A. (1984). A Separator Theorem for Chordal Graphs. SIAM Journal on Algebraic Discrete Methods, 5(3), 306-313. https://doi.org/10.1137/0605032
Gilbert, John R., Donald J. Rose, and Anders Edenbrandt. “A Separator Theorem for Chordal Graphs”. SIAM Journal on Algebraic Discrete Methods 5, no. 3 (1984): 306-13. https://doi.org/10.1137/0605032.
1.
Gilbert JR, Rose DJ, Edenbrandt A. A Separator Theorem for Chordal Graphs. SIAM Journal on Algebraic Discrete Methods. 1984;5(3):306-13.
Citations
Title Journal Journal Categories Citations Publication Date
Space efficient algorithm for solving reachability using tree decomposition and separators 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
Space-efficient algorithms for reachability in directed geometric 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
2023
Fast Spectral Approximation of Structured Graphs with Applications to Graph Filtering

Algorithms
  • Technology: Technology (General): Industrial engineering. Management engineering
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
2020
Approximation and Kernelization for Chordal Vertex Deletion 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)
2018
Bi-Covering: Covering Edges with Two Small Subsets of Vertices 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)
2017
Citations Analysis
The category Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods 14 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled The analysis of a nested dissection algorithm and was published in 1986. The most recent citation comes from a 2024 study titled Space efficient algorithm for solving reachability using tree decomposition and separators. This article reached its peak citation in 1988, with 3 citations. It has been cited in 14 different journals, 7% of which are open access. Among related journals, the Theoretical Computer Science cited this research the most, with 6 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year