On the public citation graph

Recognition and isomorphism of two dimensional partial orders

https://doi.org/10.1007/bfb0036947
0 signed · 33 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.3230110103openalex-snapshot
On testing isomorphism of permutation graphs
inferredcites →https://doi.org/10.1016/s0167-5060(08)70323-6openalex-snapshot
Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
inferredcites →https://doi.org/10.1137/0211023openalex-snapshot
The Recognition of Series Parallel Digraphs
inferredcites →https://doi.org/10.1137/0603036openalex-snapshot
The Complexity of the Partial Order Dimension Problem
inferredcites →https://doi.org/10.1145/322123.322125openalex-snapshot
A Linear Time Algorithm for Deciding Interval Graph Isomorphism
inferredcites →https://doi.org/10.1145/800061.808777openalex-snapshot
Transitive orientation in 0(n 2 ) time
inferredcites →https://doi.org/10.1145/800135.804393openalex-snapshot
The recognition of Series Parallel digraphs
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/11785293_7openalex-snapshot
A Simpler Linear-Time Recognition of Circular-Arc Graphs
inferred← citeshttps://doi.org/10.1007/3-540-53832-1_31openalex-snapshot
Avoiding matrix multiplication
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_98openalex-snapshot
A tight lower bound for primitivity in k-structures
inferred← citeshttps://doi.org/10.1007/3-540-58950-3_375openalex-snapshot
Characterization and recognition of point-halfspace and related orders
inferred← citeshttps://doi.org/10.1007/978-3-642-02029-2_16openalex-snapshot
O(m logn) Split Decomposition of Strongly Connected Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-11440-3_12openalex-snapshot
Reconstruction Algorithm for Permutation Graphs
inferred← citeshttps://doi.org/10.1007/978-94-009-2639-4_4openalex-snapshot
Computationally Tractable Classes of Ordered Sets
inferred← citeshttps://doi.org/10.1007/978-94-009-2639-4_6openalex-snapshot
The Calculation of Invariants for Ordered Sets
inferred← citeshttps://doi.org/10.1007/bf00383402openalex-snapshot
Transitive closure for restricted classes of partial orders
inferred← citeshttps://doi.org/10.1007/bfb0036892openalex-snapshot
Automata, Languages and Programming
inferred← citeshttps://doi.org/10.1007/s00453-010-9432-yopenalex-snapshot
A Simpler Linear-Time Recognition of Circular-Arc Graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(88)90038-xopenalex-snapshot
Circular-arc graphs with clique cover number two
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90180-iopenalex-snapshot
P4-trees and substitution decomposition
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00056-jopenalex-snapshot
A recognition algorithm for orders of interval dimension two
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00272-xopenalex-snapshot
Characterization and complexity of uniformly nonprimitive labeled 2-structures
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90233-xopenalex-snapshot
A k-structure generalization of the theory of 2-structures
inferred← citeshttps://doi.org/10.1016/j.dam.2009.10.008openalex-snapshot
O(mlogn) split decomposition of strongly-connected graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00319-7openalex-snapshot
Modular decomposition and transitive orientation
inferred← citeshttps://doi.org/10.1137/0214048openalex-snapshot
On Comparability and Permutation Graphs
inferred← citeshttps://doi.org/10.1145/58562.59300openalex-snapshot
Incremental modular decomposition
inferred← citeshttps://doi.org/10.1587/transfun.e98.a.1161openalex-snapshot
Algorithm for Identifying the Maximum Detour Hinge Vertices of a Permutation Graph
inferred← citeshttps://doi.org/10.1587/transinf.e96.d.426openalex-snapshot
Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs
inferred← citeshttps://doi.org/10.47191/ijmcr/v13i1.07openalex-snapshot
A SURVEY OF DIMENSION OF POSETS
inferred← citeshttps://doi.org/10.5555/313559.313637openalex-snapshot
An O(n2 algorithm for circular-arc graph recognition
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.