On the public citation graph

An optimal pram algorithm for a spanning tree on trapezoid graphs

https://doi.org/10.1007/bf02936178
0 signed · 25 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/j.1538-7305.1957.tb01515.xopenalex-snapshot
Shortest Connection Networks And Some Generalizations
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/bf02288325openalex-snapshot
Algorithms for finding optimum trees: Description, use and evaluation
inferredcites →https://doi.org/10.1007/bf02579168openalex-snapshot
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
inferredcites →https://doi.org/10.1016/0020-0190(75)90056-3openalex-snapshot
An 0(|E|loglog|V|) algorithm for finding minimum spanning trees
inferredcites →https://doi.org/10.1016/0020-0190(90)90015-popenalex-snapshot
A parallel algorithm for eliminating cycles in undirected graphs
inferredcites →https://doi.org/10.1016/0020-0190(93)90019-6openalex-snapshot
An O(log m) parallel algorithm for the minimum spanning tree problem
inferredcites →https://doi.org/10.1016/0020-0190(95)00125-vopenalex-snapshot
An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs
inferredcites →https://doi.org/10.1080/00207169908804777openalex-snapshot
An efficient algorithm to generate all maximal independent sets on trapezoid graphs
inferredcites →https://doi.org/10.1090/s0002-9939-1956-0078686-7openalex-snapshot
On the shortest spanning subtree of a graph and the traveling salesman problem
inferredcites →https://doi.org/10.1109/proc.1975.9996openalex-snapshot
Graph theory with applications to engineering and computer science
inferredcites →https://doi.org/10.1109/sfcs.1984.715934openalex-snapshot
Fibonacci Heaps And Their Uses In Improved Network Optimization Algorithms
inferredcites →https://doi.org/10.1109/tc.1985.6312202openalex-snapshot
The power of parallel prefix
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/s40819-017-0372-yopenalex-snapshot
L(0, 1)-Labelling of Trapezoid Graphs
inferred← citeshttps://doi.org/10.1080/09720529.2007.10698146openalex-snapshot
A simple optimal parallel algorithm for constructing a spanning tree of a trapezoid graph
inferred← citeshttps://doi.org/10.1093/ietfec/e91-a.9.2296openalex-snapshot
An Optimal Parallel Algorithm for Constructing a Spanning Forest on Trapezoid Graphs
inferred← citeshttps://doi.org/10.1587/transfun.e96.a.1051openalex-snapshot
A Linear-Time Algorithm for Constructing a Spanning Tree on Circular Trapezoid Graphs
inferred← citeshttps://doi.org/10.1587/transinf.e92.d.141openalex-snapshot
An Optimal Parallel Algorithm for Constructing a Spanning Tree on Circular Permutation Graphs
inferred← citeshttps://doi.org/10.4018/978-1-5225-9380-5.ch002openalex-snapshot
An Introduction to Intersection Graphs
inferred← citeshttps://doi.org/10.4236/jamp.2018.68141openalex-snapshot
An Optimal Parallel Algorithm for Constructing a Spanning Tree on Proper Circle Trapezoid Graphs
inferred← citeshttps://doi.org/10.4236/jcc.2017.514005openalex-snapshot
A Parallel Algorithm for the Spanning Forest Problem on Proper Circle Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1404.5468openalex-snapshot
Intersection Graphs: An Introduction
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
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.