Circuit bases of strongly connected digraphs

Article Properties
Cite
Gleiss, Petra M., et al. “Circuit Bases of Strongly Connected Digraphs”. Discussiones Mathematicae Graph Theory, vol. 23, no. 2, 2003, p. 241, https://doi.org/10.7151/dmgt.1200.
Gleiss, P. M., Leydold, J., & Stadler, P. F. (2003). Circuit bases of strongly connected digraphs. Discussiones Mathematicae Graph Theory, 23(2), 241. https://doi.org/10.7151/dmgt.1200
Gleiss PM, Leydold J, Stadler PF. Circuit bases of strongly connected digraphs. Discussiones Mathematicae Graph Theory. 2003;23(2):241.
Journal Category
Science
Mathematics
Citations
Title Journal Journal Categories Citations Publication Date
Wireless Network Scheduling With Discrete Propagation Delays: Theorems and Algorithms IEEE Transactions on Information Theory
  • Science: Science (General): Cybernetics: Information theory
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electric apparatus and materials. Electric circuits. Electric networks
  • Technology: Technology (General): Industrial engineering. Management engineering: Information technology
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Telecommunication
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
2024
Forward and Line-Based Cycle Bases for Periodic Timetabling

Operations Research Forum 2023
The feasible regions for consecutive patterns of pattern-avoiding permutations Discrete Mathematics
  • Science: Mathematics
1 2023
Enumerating k-Arc-Connected Orientations 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)
1 2020
On Bubble Generators in Directed Graphs 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)
2019
Citations Analysis
The category Science: Mathematics 5 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Faster Algorithms for Minimum Cycle Basis in Directed Graphs and was published in 2008. The most recent citation comes from a 2024 study titled Wireless Network Scheduling With Discrete Propagation Delays: Theorems and Algorithms. This article reached its peak citation in 2023, with 2 citations. It has been cited in 11 different journals. Among related journals, the Algorithmica cited this research the most, with 2 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year