On the public citation graph

Ordered Vertex Partitioning

0 signed · 41 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.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-60618-1_83openalex-snapshot
Efficient parallel modular decomposition (extended abstract)
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/bf00390110openalex-snapshot
Algorithmic graph theory and perfect graphs
inferredcites →https://doi.org/10.1007/bf02020961openalex-snapshot
Transitiv orientierbare Graphen
inferredcites →https://doi.org/10.1016/c2013-0-10739-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
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-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.14279/depositonce-14267openalex-snapshot
Efficient and practical modular decomposition
inferredcites →https://doi.org/10.5555/314161.314172openalex-snapshot
Linear-time transitive orientation
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.2001.1185openalex-snapshot
Efficient and Practical Algorithms for Sequential Modular Decomposition
inferred← citeshttps://doi.org/10.1007/0-387-25036-0_4openalex-snapshot
Decompositions and Forcing Relations in Graphs and Other Combinatorial Structures
inferred← citeshttps://doi.org/10.1007/11557067_19openalex-snapshot
Perfect Sorting by Reversals Is Not Always Difficult
inferred← citeshttps://doi.org/10.1007/11561071_69openalex-snapshot
Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs
inferred← citeshttps://doi.org/10.1007/11847250_1openalex-snapshot
Applying Modular Decomposition to Parameterized Bicluster 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-70575-8_52openalex-snapshot
Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
inferred← citeshttps://doi.org/10.1007/s00224-007-9032-7openalex-snapshot
Applying Modular Decomposition to Parameterized Cluster Editing Problems
inferred← citeshttps://doi.org/10.1007/s00373-011-1049-7openalex-snapshot
On the Convexity Number of Graphs
inferred← citeshttps://doi.org/10.1007/s00453-003-1032-7openalex-snapshot
Linear-Time Recognition of Circular-Arc Graphs
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.cosrev.2010.01.001openalex-snapshot
A survey of the algorithmic aspects of modular decomposition
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/j.disc.2008.04.020openalex-snapshot
On the computation of the hull number of a graph
inferred← citeshttps://doi.org/10.1016/j.disc.2009.09.018openalex-snapshot
Some remarks on the geodetic number of a graph
inferred← citeshttps://doi.org/10.1016/j.endm.2004.06.026openalex-snapshot
A representation for the modular-pairs of a cograph by modular decomposition
inferred← citeshttps://doi.org/10.1109/sfcs.2001.959913openalex-snapshot
Linear-time recognition of circular-arc graphs
inferred← citeshttps://doi.org/10.1109/tcbb.2007.1011openalex-snapshot
Perfect Sorting by Reversals Is Not Always Difficult
inferred← citeshttps://doi.org/10.1186/gb-2004-5-8-r57openalex-snapshot
Modular decomposition of protein-protein interaction networks
inferred← citeshttps://doi.org/10.26493/2590-9770.1252.e71openalex-snapshot
Cograph editing: Merging modules is equivalent to editing P_4s
inferred← citeshttps://doi.org/10.3126/tuj.v27i1-2.26400openalex-snapshot
Some Discrete Optimization Problems With Hamming and H-Comparability Graphs
inferred← citeshttps://doi.org/10.46298/dmtcs.303openalex-snapshot
Partially complemented representations of digraphs
inferred← citeshttps://doi.org/10.48550/arxiv.0912.1457openalex-snapshot
A survey on algorithmic aspects of modular decomposition
inferred← citeshttps://doi.org/10.48550/arxiv.1503.02773openalex-snapshot
Simpler, Linear-Time Transitive Orientation via Lexicographic Breadth-First Search
inferred← citeshttps://doi.org/10.48550/arxiv.1506.00944openalex-snapshot
Parameterized mixed cluster editing via modular decomposition
inferred← citeshttps://doi.org/10.48550/arxiv.1702.07499openalex-snapshot
Cograph Editing: Merging Modules is equivalent to Editing P4's
inferred← citeshttps://doi.org/10.48550/arxiv.1710.04333openalex-snapshot
Modular decomposition of transitive graphs and transitively orienting their complements
inferred← citeshttps://doi.org/10.48550/arxiv.1904.03558openalex-snapshot
A characterization of maximal 2-dimensional subgraphs of transitive graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1457openalex-snapshot
On transitive orientations of G-e
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.