On the public citation graph

Transitive closure for restricted classes of partial orders

https://doi.org/10.1007/bf00383402
0 signed · 32 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/net.3230020103openalex-snapshot
Partial orders of dimension 2
inferredcites →https://doi.org/10.1007/978-94-009-2639-4_4openalex-snapshot
Computationally Tractable Classes of Ordered Sets
inferredcites →https://doi.org/10.1007/bf00385814openalex-snapshot
Cycle-free partial orders and chordal comparability graphs
inferredcites →https://doi.org/10.1007/bfb0036947openalex-snapshot
Recognition and isomorphism of two dimensional partial orders
inferredcites →https://doi.org/10.1016/0012-365x(87)90006-9openalex-snapshot
On some complexity properties of N-free posets and posets with bounded decomposition diameter
inferredcites →https://doi.org/10.1016/0020-0190(82)90080-1openalex-snapshot
A labeling algorithm to recognize a line digraph and output its root graph
inferredcites →https://doi.org/10.1016/0166-218x(92)90180-iopenalex-snapshot
P4-trees and substitution decomposition
inferredcites →https://doi.org/10.1016/0196-6774(87)90029-0openalex-snapshot
Searching in 2-dimensional partial orders
inferredcites →https://doi.org/10.1016/c2013-0-10739-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1137/0208031openalex-snapshot
Scheduling Interval-Ordered Tasks
inferredcites →https://doi.org/10.1137/0211023openalex-snapshot
The Recognition of Series Parallel Digraphs
inferredcites →https://doi.org/10.1137/0214048openalex-snapshot
On Comparability and Permutation Graphs
inferredcites →https://doi.org/10.1137/0603036openalex-snapshot
The Complexity of the Partial Order Dimension Problem
inferredcites →https://doi.org/10.1145/1008861.1008865openalex-snapshot
A general method for solving divide-and-conquer recurrences
inferredcites →https://doi.org/10.1145/28395.28396openalex-snapshot
Matrix multiplication via arithmetic progressions
inferredcites →https://doi.org/10.1145/58562.59300openalex-snapshot
Incremental modular decomposition
inferredcites →https://doi.org/10.1287/moor.9.2.248openalex-snapshot
Single Machine Scheduling with Precedence Constraints of Dimension 2
inferredcites →https://doi.org/10.2307/2371374openalex-snapshot
Partially Ordered Sets
inferredcites →https://doi.org/10.4153/cjm-1971-016-5openalex-snapshot
Transitive Orientation of Graphs and Identification of Permutation Graphs

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-53832-1_31openalex-snapshot
Avoiding matrix multiplication
inferred← citeshttps://doi.org/10.1007/978-3-642-25878-7_2openalex-snapshot
Confluent Hasse Diagrams
inferred← citeshttps://doi.org/10.1007/bfb0019425openalex-snapshot
Dimension and algorithms
inferred← citeshttps://doi.org/10.1007/bfb0019432openalex-snapshot
Representation of an order as union of interval orders
inferred← citeshttps://doi.org/10.1007/s00778-018-0495-8openalex-snapshot
Accelerating reachability query processing based on $$\varvec{DAG}$$ DAG reduction
inferred← citeshttps://doi.org/10.1007/s11083-005-9000-2openalex-snapshot
Erratum: On the Contractions of Vectorial Lattice Representations
inferred← citeshttps://doi.org/10.1007/s40305-013-0025-8openalex-snapshot
Computational Complexity of a Solution for Directed Graph Cooperative Games
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90164-oopenalex-snapshot
On the calculation of transitive reduction—closure of orders
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00090-2openalex-snapshot
On building the transitive reduction of a two-dimensional poset
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00210-1openalex-snapshot
Parallel N-free order recognition
inferred← citeshttps://doi.org/10.1137/s0097539797322334openalex-snapshot
Weakly Triangulated Comparability 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.