On the public citation graph
A linear algorithm to decompose inheritance graphs into modules
0 signed · 27 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-47891-4_15openalex-snapshot
The Common Lisp Object System: An Overview
inferredcites →https://doi.org/10.1007/978-94-009-2639-4_6openalex-snapshot
The Calculation of Invariants for Ordered Sets
inferredcites →https://doi.org/10.1007/bf00563529openalex-snapshot
The number of depth-first searches of an ordered set
inferredcites →https://doi.org/10.1016/0166-218x(79)90043-xopenalex-snapshot
On the X-join decomposition for undirected graphs
inferredcites →https://doi.org/10.1016/0166-218x(92)90180-iopenalex-snapshot
P4-trees and substitution decomposition
inferredcites →https://doi.org/10.1051/ita/1979130100031openalex-snapshot
Nombre de sauts et graphes série-parallèles
inferredcites →https://doi.org/10.1137/0201008openalex-snapshot
The Transitive Reduction of a Directed Graph
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1137/0211023openalex-snapshot
The Recognition of Series Parallel Digraphs
inferredcites →https://doi.org/10.1145/382192.383004openalex-snapshot
Concepts and paradigms of object-oriented programming
inferredcites →https://doi.org/10.1145/58562.59300openalex-snapshot
Incremental modular decomposition
inferredcites →https://doi.org/10.1145/59287.59293openalex-snapshot
Efficient implementation of lattice operations
inferredcites →https://doi.org/10.1145/73833.73839openalex-snapshot
Area requirement and symmetry display in drawing 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/11602613_16openalex-snapshot
Revisiting T. Uno and M. Yagiura’s Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-61534-2_18openalex-snapshot
Sparse term encoding for dynamic taxonomies
inferred← citeshttps://doi.org/10.1007/978-3-540-27810-8_17openalex-snapshot
A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension
inferred← citeshttps://doi.org/10.1007/bfb0017474openalex-snapshot
A new linear algorithm for Modular Decomposition
inferred← citeshttps://doi.org/10.1007/bfb0024493openalex-snapshot
Block decomposition of inheritance hierarchies
inferred← citeshttps://doi.org/10.1016/j.cosrev.2010.01.001openalex-snapshot
A survey of the algorithmic aspects of modular decomposition
inferred← citeshttps://doi.org/10.1016/j.endm.2005.06.003openalex-snapshot
Graph decompositions definable in monadic second-order logic
inferred← citeshttps://doi.org/10.1016/j.jalgor.2005.08.001openalex-snapshot
Lowest common ancestors in trees and directed acyclic graphs
inferred← citeshttps://doi.org/10.1109/istcs.1997.595165openalex-snapshot
Graph decompositions and factorizing permutations
inferred← citeshttps://doi.org/10.1142/s0129054199000125openalex-snapshot
PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT
inferred← citeshttps://doi.org/10.2168/lmcs-2(2:2)2006openalex-snapshot
The monadic second-order logic of graphs XVI : Canonical graph decompositions
inferred← citeshttps://doi.org/10.46298/dmtcs.298openalex-snapshot
Graph Decompositions and Factorizing Permutations
inferred← citeshttps://doi.org/10.48550/arxiv.0912.1457openalex-snapshot
A survey on algorithmic aspects of modular decomposition
inferred← citeshttps://doi.org/10.5555/365411.365795openalex-snapshot
Finding least common ancestors in directed acyclic 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.