On the public citation graph
A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs
0 signed · 24 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.1007/3-540-57899-4_69openalex-snapshot
Two algorithms for finding rectangular duals of planar graphs
inferredcites →https://doi.org/10.1007/3-540-61332-3_141openalex-snapshot
Output-sensitive reporting of disjoint paths (extended abstract)
inferredcites →https://doi.org/10.1007/3-540-62559-3_27openalex-snapshot
Independent spanning trees of product graphs
inferredcites →https://doi.org/10.1007/pl00009264openalex-snapshot
Output-Sensitive Reporting of Disjoint Paths
inferredcites →https://doi.org/10.1016/0020-0190(92)90230-sopenalex-snapshot
On independent spanning trees
inferredcites →https://doi.org/10.1016/0196-6774(88)90015-6openalex-snapshot
Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
inferredcites →https://doi.org/10.1016/0890-5401(88)90016-8openalex-snapshot
The multi-tree approach to reliability in distributed networks
inferredcites →https://doi.org/10.1016/s0020-0190(97)00083-5openalex-snapshot
A linear-time algorithm for four-partitioning four-connected planar graphs
inferredcites →https://doi.org/10.1016/s0304-0208(08)x7180-4openalex-snapshot
Planar Graphs: Theory and Algorithms
inferredcites →https://doi.org/10.1142/s0218195997000144openalex-snapshot
Convex Grid Drawings of 3-Connected Planar Graphs
inferredcites →https://doi.org/10.1145/800057.808723openalex-snapshot
A new look at fault tolerant network routing
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-36379-3_21openalex-snapshot
Completely Independent Spanning Trees in Maximal Planar Graphs
inferred← citeshttps://doi.org/10.1007/3-540-40064-8_27openalex-snapshot
A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-981-97-0566-5_26openalex-snapshot
(t, s)-Completely Independent Spanning Trees
inferred← citeshttps://doi.org/10.1016/j.jpdc.2012.07.003openalex-snapshot
An efficient parallel construction of optimal independent spanning trees on hypercubes
inferred← citeshttps://doi.org/10.1016/j.osnem.2018.12.001openalex-snapshot
Source detection of rumor in social network – A review
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.061openalex-snapshot
Constructing independent spanning trees for locally twisted cubes
inferred← citeshttps://doi.org/10.1109/comst.2016.2615098openalex-snapshot
Identifying Propagation Sources in Networks: State-of-the-Art and Comparative Studies
inferred← citeshttps://doi.org/10.1109/csae.2011.5952464openalex-snapshot
Construction of independent spanning trees on twisted-cubes
inferred← citeshttps://doi.org/10.1109/i-span.2009.97openalex-snapshot
Constructing Independent Spanning Trees for Hypercubes and Locally Twisted Cubes
inferred← citeshttps://doi.org/10.1587/transfun.2024dmp0012openalex-snapshot
(t, s)-Completely Independent Spanning Trees
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.