On the public citation graph

AnO(n 2) incremental algorithm for modular decomposition of graphs and 2-structures

0 signed · 49 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/jgt.3190020104openalex-snapshot
Graphs with unique maximal clumpings
inferredcites →https://doi.org/10.1006/jagm.1994.1013openalex-snapshot
An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs
inferredcites →https://doi.org/10.1007/3-540-56402-0_49openalex-snapshot
An efficient algorithm to recognize prime undirected graphs
inferredcites →https://doi.org/10.1007/978-94-009-5315-4_1openalex-snapshot
Comparability Graphs
inferredcites →https://doi.org/10.1007/978-94-009-5315-4_2openalex-snapshot
Algorithmic Aspects of Comparability Graphs and Interval Graphs
inferredcites →https://doi.org/10.1007/978-94-009-7798-3_21openalex-snapshot
Machine Scheduling with Precedence Constraints
inferredcites →https://doi.org/10.1007/bf00967091openalex-snapshot
To the undimmed memory of petr Grigor'evich Kontorovich: Partially ordered sets and their comparability graphs
inferredcites →https://doi.org/10.1007/bf02020961openalex-snapshot
Transitiv orientierbare Graphen
inferredcites →https://doi.org/10.1007/bf02022041openalex-snapshot
Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and Boolean functions
inferredcites →https://doi.org/10.1016/0012-365x(81)90138-2openalex-snapshot
Partitive hypergraphs
inferredcites →https://doi.org/10.1016/0012-365x(89)90209-4openalex-snapshot
P4-comparability graphs
inferredcites →https://doi.org/10.1016/0012-365x(90)90067-ropenalex-snapshot
Decomposition of k-ary relations
inferredcites →https://doi.org/10.1016/0012-365x(93)90516-vopenalex-snapshot
Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
inferredcites →https://doi.org/10.1016/0012-365x(94)90107-4openalex-snapshot
Incremental construction of 2-structures
inferredcites →https://doi.org/10.1016/0095-8956(77)90049-1openalex-snapshot
Comparability graphs and a new matroid
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.1016/0304-3975(90)90129-6openalex-snapshot
Theory of 2-structures, part I: Clans, basic subclasses, and morphisms
inferredcites →https://doi.org/10.1016/0304-3975(90)90130-aopenalex-snapshot
Theory of 2-structures, part II: Representation through labeled tree families
inferredcites →https://doi.org/10.1016/0304-3975(94)90233-xopenalex-snapshot
A k-structure generalization of the theory of 2-structures
inferredcites →https://doi.org/10.1016/0771-050x(80)90036-4openalex-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.1016/s0167-5060(13)71057-4openalex-snapshot
Annals of Discrete Mathematics 58
inferredcites →https://doi.org/10.1016/s0304-0208(08)72966-9openalex-snapshot
Substitution Decomposition for Discrete Structures and Connections with Combinatorial Optimization
inferredcites →https://doi.org/10.1090/s0002-9947-1981-0617556-9openalex-snapshot
Arborescent Structures. II: Interpretability in the Theory of Trees
inferredcites →https://doi.org/10.1090/tranopenalex-snapshot
Transactions of the American Mathematical Society
inferredcites →https://doi.org/10.1137/0211023openalex-snapshot
The Recognition of Series Parallel Digraphs
inferredcites →https://doi.org/10.1137/0214065openalex-snapshot
A Linear Recognition Algorithm for Cographs
inferredcites →https://doi.org/10.1137/0603021openalex-snapshot
Decomposition of Directed Graphs
inferredcites →https://doi.org/10.1145/58562.59300openalex-snapshot
Incremental modular decomposition
inferredcites →https://doi.org/10.1287/moor.8.2.170openalex-snapshot
A Fast Algorithm for the Decomposition of Graphs and Posets
inferredcites →https://doi.org/10.4153/cjm-1980-057-7openalex-snapshot
A Combinatorial Decomposition Theory
inferredcites →https://doi.org/10.5555/314464.314641openalex-snapshot
Linear-time modular decomposition and efficient transitive orientation of comparability graphs

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jagm.1999.1016openalex-snapshot
An Algorithm for the Modular Decomposition of Hypergraphs
inferred← citeshttps://doi.org/10.1006/jagm.2001.1185openalex-snapshot
Efficient and Practical Algorithms for Sequential Modular Decomposition
inferred← citeshttps://doi.org/10.1007/3-540-46784-x_12openalex-snapshot
NLC2-Decomposition in Polynomial Time
inferred← citeshttps://doi.org/10.1007/978-3-030-01768-2_20openalex-snapshot
Decomposition of Quantitative Gaifman Graphs as a Data Analysis Tool
inferred← citeshttps://doi.org/10.1007/s00285-016-1084-3openalex-snapshot
The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations
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.2004.02.017openalex-snapshot
Linear-time modular decomposition of directed graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2008.06.028openalex-snapshot
Dynamically maintaining split graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2021.12.017openalex-snapshot
From modular decomposition trees to rooted median graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2022.06.042openalex-snapshot
From modular decomposition trees to level-1 networks: Pseudo-cographs, polar-cats and prime polar-cats
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00319-7openalex-snapshot
Modular decomposition and transitive orientation
inferred← citeshttps://doi.org/10.1142/s0129054100000223openalex-snapshot
NLC 2-DECOMPOSITION IN POLYNOMIAL TIME
inferred← citeshttps://doi.org/10.48550/arxiv.1910.05146openalex-snapshot
Analysis of Co-Occurrence Patterns in Data through Modular and Clan Decompositions of Gaifman Graphs
inferred← citeshttps://doi.org/10.5555/314161.314172openalex-snapshot
Linear-time transitive orientation
inferred← citeshttps://doi.org/10.5555/545381.545494openalex-snapshot
Construction of probe interval models
inferred← citeshttps://doi.org/10.5821/dissertation-2117-330388openalex-snapshot
Data analysis through graph decomposition
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.