On the public citation graph
Efficient algorithms to compute all articulation points of a permutation graph
0 signed · 23 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.1975.5.3.299openalex-snapshot
GRAPH THEORY WITH APPLICATIONS TO ENGINEERING AND COMPUTER SCIENCE
inferredcites →https://doi.org/10.1007/978-1-4612-9967-7openalex-snapshot
Graph Theory: An Introductory Course
inferredcites →https://doi.org/10.1016/0020-0190(92)90244-popenalex-snapshot
Optimal parallel algorithms for finding cut vertices and bridges of interval graphs
inferredcites →https://doi.org/10.1016/0771-050x(80)90036-4openalex-snapshot
Algorithmic graph theory and perfect graphs
inferredcites →https://doi.org/10.1016/0890-5401(89)90036-9openalex-snapshot
Faster optimal parallel prefix sums and list ranking
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1109/proc.1975.9996openalex-snapshot
Graph theory with applications to engineering and computer science
inferredcites →https://doi.org/10.1137/0213036openalex-snapshot
Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
inferredcites →https://doi.org/10.1137/0214061openalex-snapshot
An Efficient Parallel Biconnectivity Algorithm
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf02935789openalex-snapshot
An efficient pram algorithm for maximum-weight independent set on permutation graphs
inferred← citeshttps://doi.org/10.1007/s10852-015-9280-5openalex-snapshot
L(0,1)-labelling of Permutation Graphs
inferred← citeshttps://doi.org/10.1023/b:coap.0000004982.13444.bcopenalex-snapshot
Optimal Sequential and Parallel Algorithms to Compute All Cut Vertices on Trapezoid Graphs
inferred← citeshttps://doi.org/10.1080/00207160008804965openalex-snapshot
An optimal parallel algorithm for computing cut vertices and blocks on interval graphs
inferred← citeshttps://doi.org/10.1080/00207169908804868openalex-snapshot
An optimal parallel algorithm to compute all cutvertices and blocks on permutation graphs
inferred← citeshttps://doi.org/10.1109/iccis.2010.216openalex-snapshot
A Study of Node Classification-Based Analysis Model about Gas Pipeline Network Burst
inferred← citeshttps://doi.org/10.4018/978-1-5225-9380-5.ch002openalex-snapshot
An Introduction to Intersection Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1404.5468openalex-snapshot
Intersection Graphs: An Introduction
inferred← citeshttps://doi.org/10.48550/arxiv.1407.5488openalex-snapshot
L(2,1)-labelling of Circular-arc Graph
inferred← citeshttps://doi.org/10.48550/arxiv.1407.8132openalex-snapshot
Computation of a Tree 3-Spanner on Trapezoid Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1408.4005openalex-snapshot
Cactus Graphs and Some Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1409.1987openalex-snapshot
Complexity to Find Wiener Index of Some Graphs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.