Depth-first search in directed planar graphs, revisited
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2022/06/04
-
Journal
-
Indian UGC (journal)
-
Refrences41
-
Citations1
-
Eric Allender ORCID (unauthenticated)
-
Archit Chauhan
-
Samir Datta
Cite
Allender, Eric, et al. “Depth-First Search in Directed Planar Graphs, Revisited”. Acta Informatica, vol. 59, no. 4, 2022, pp. 289-1, https://doi.org/10.1007/s00236-022-00425-1.
Allender, E., Chauhan, A., & Datta, S. (2022). Depth-first search in directed planar graphs, revisited. Acta Informatica, 59(4), 289-319. https://doi.org/10.1007/s00236-022-00425-1
Allender, Eric, Archit Chauhan, and Samir Datta. “Depth-First Search in Directed Planar Graphs, Revisited”. Acta Informatica 59, no. 4 (2022): 289-319. https://doi.org/10.1007/s00236-022-00425-1.
Allender E, Chauhan A, Datta S. Depth-first search in directed planar graphs, revisited. Acta Informatica. 2022;59(4):289-31.
Journal Categories
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Science (General)
Cybernetics
Information theory
Technology
Electrical engineering
Electronics
Nuclear engineering
Telecommunication
Technology
Technology (General)
Industrial engineering
Management engineering
Information technology
You May Also Like
- A New Approach to Abstract Syntax with Variable Binding
- Soundness of workflow nets: classification, decidability, and analysis
- Automatic Verification of a Behavioural Subset of UML Statechart Diagrams Using the SPIN Model-checker
- Uppaal in a nutshell
- Coloured Petri Nets and CPN Tools for modelling and validation of concurrent systems
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Space-Efficient DFS and Applications to Connectivity Problems: Simpler, Leaner, Faster | Algorithmica |
| 6 | 2020 |
| Maximum Flow in Directed Planar Graphs with Vertex Capacities | Algorithmica |
| 6 | 2011 |
| The Isomorphism Problem for Planar 3-Connected Graphs Is in Unambiguous Logspace | Theory of Computing Systems |
| 5 | 2010 |
An
O
(
n
log
n
) algorithm for maximum
st
-flow in a directed planar graph | Journal of the ACM |
| 22 | 2009 |
| Planar and Grid Graph Reachability Problems | Theory of Computing Systems |
| 15 | 2009 |
Refrences Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science 24
is the most frequently represented among the references in this article. It primarily includes studies from SIAM Journal on Computing and Theory of Computing Systems. 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 |
|---|---|---|---|---|
The Profiles Based on Ridge and Valley Lines to Extract Shoulder Lines on the Loess Plateau | Remote Sensing |
| 2023 |
Citations Analysis
| Category | Category Repetition |
|---|---|
| Science | 1 |
| Geography. Anthropology. Recreation: Environmental sciences | 1 |
| Science: Geology | 1 |
| Geography. Anthropology. Recreation: Geography (General) | 1 |
| Technology: Photography | 1 |
The category
Science 1
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled The Profiles Based on Ridge and Valley Lines to Extract Shoulder Lines on the Loess Plateau and was published in 2023. The most recent citation comes from a 2023 study titled The Profiles Based on Ridge and Valley Lines to Extract Shoulder Lines on the Loess Plateau. This article reached its peak citation in 2023, with 1 citations. It has been cited in 1 different journals, 100% of which are open access. Among related journals, the Remote Sensing cited this research the most, with 1 citations. The chart below illustrates the annual citation trends for this article.