On the public citation graph

Graph Decompositions and Factorizing Permutations

0 signed · 43 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.1006/jagm.1994.1007openalex-snapshot
An O(n2) Algorithm for Undirected Split Decomposition
inferredcites →https://doi.org/10.1007/3-540-54945-5_49openalex-snapshot
Substitution decomposition on chordal graphs and applications
inferredcites →https://doi.org/10.1007/3-540-56402-0_31openalex-snapshot
A simple test for interval graphs
inferredcites →https://doi.org/10.1007/bf00390110openalex-snapshot
Algorithmic graph theory and perfect graphs
inferredcites →https://doi.org/10.1007/bf01189070openalex-snapshot
A linear algorithm to decompose inheritance graphs into modules
inferredcites →https://doi.org/10.1007/bfb0017474openalex-snapshot
A new linear algorithm for Modular Decomposition
inferredcites →https://doi.org/10.1007/bfb0024493openalex-snapshot
Block decomposition of inheritance hierarchies
inferredcites →https://doi.org/10.1016/c2013-0-10739-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/j.dam.2004.01.011openalex-snapshot
A simple linear time algorithm for cograph recognition
inferredcites →https://doi.org/10.1016/s0012-365x(98)00319-7openalex-snapshot
Modular decomposition and transitive orientation
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
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.1016/s0304-3975(97)00241-7openalex-snapshot
Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
inferredcites →https://doi.org/10.1109/istcs.1997.595165openalex-snapshot
Graph decompositions and factorizing permutations
inferredcites →https://doi.org/10.1137/0202012openalex-snapshot
Dividing a Graph into Triconnected Components
inferredcites →https://doi.org/10.1137/0603021openalex-snapshot
Decomposition of Directed Graphs
inferredcites →https://doi.org/10.14279/depositonce-14267openalex-snapshot
Efficient and practical modular decomposition
inferredcites →https://doi.org/10.4153/cjm-1980-057-7openalex-snapshot
A Combinatorial Decomposition Theory

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/11604686_37openalex-snapshot
Algebraic Operations on PQ Trees and Modular Decomposition Trees
inferred← citeshttps://doi.org/10.1007/11917496_25openalex-snapshot
Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-25005-8_21openalex-snapshot
A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-86593-1_12openalex-snapshot
Linear-Time Minimal Cograph Editing
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/978-3-540-30559-0_8openalex-snapshot
Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_52openalex-snapshot
Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_43openalex-snapshot
A Representation Theorem for Union-Difference Families and Application
inferred← citeshttps://doi.org/10.1007/s10618-016-0451-4openalex-snapshot
An efficient exact algorithm for triangle listing in large graphs
inferred← citeshttps://doi.org/10.1016/j.aam.2022.102377openalex-snapshot
Complete edge-colored permutation graphs
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.dam.2004.01.011openalex-snapshot
A simple linear time algorithm for cograph recognition
inferred← citeshttps://doi.org/10.1016/j.dam.2006.03.005openalex-snapshot
Fully dynamic recognition algorithm and certificate for directed cographs
inferred← citeshttps://doi.org/10.1016/j.dam.2008.11.001openalex-snapshot
Algorithmic aspects of a general modular decomposition theory
inferred← citeshttps://doi.org/10.1016/j.dam.2020.08.002openalex-snapshot
Faster and enhanced inclusion-minimal cograph completion
inferred← citeshttps://doi.org/10.1016/j.disc.2011.05.037openalex-snapshot
Decomposition tree of a lexicographic product of binary structures
inferred← citeshttps://doi.org/10.1016/j.future.2017.04.005openalex-snapshot
Querying massive graph data: A compress and search approach
inferred← citeshttps://doi.org/10.1016/j.patcog.2014.03.014openalex-snapshot
A distance measure for large graphs based on prime graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.04.052openalex-snapshot
A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs
inferred← citeshttps://doi.org/10.1109/socpar.2014.7007990openalex-snapshot
Complex systems approximate matching approach for large graphs classification optimized by NSGA-II
inferred← citeshttps://doi.org/10.48550/arxiv.0912.1457openalex-snapshot
A survey on algorithmic aspects of modular decomposition
inferred← citeshttps://doi.org/10.70675/087fd6d3z81e4z4e4bz9293z4bbda9dbc31aopenalex-snapshot
Gérer et analyser les grands graphes des entités nommées
inferred← citeshttps://doi.org/10.70675/4436eb34zd9d8z4df2zb413zaa402e87331copenalex-snapshot
Subgraph Isomorphism Search In Massive Graph Data
inferred← citeshttps://doi.org/10.70675/f83981b3zc5b0z4d80z8f83z13f6f7248e04openalex-snapshot
Heuristiques et conjectures à propos de la 2-dimension des ordres partiels
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.