On the public citation graph
Cartesian graph factorization at logarithmic cost per edge
0 signed · 55 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.1016/0012-365x(92)90274-jopenalex-snapshot
Computing equivalence classes among the edges of a graph with applications
inferredcites →https://doi.org/10.1016/0012-365x(92)90283-lopenalex-snapshot
A note on Winkler's algorithm for factoring a connected graph
inferredcites →https://doi.org/10.1016/0166-218x(85)90066-6openalex-snapshot
A polynomial time algorithm for finding the prime factors of cartesian-product graphs
inferredcites →https://doi.org/10.1016/s0195-6698(87)80012-4openalex-snapshot
Factoring a Graph in Polynomial Time
inferredcites →https://doi.org/10.1090/s0002-9947-1985-0776391-5openalex-snapshot
On isometric embeddings of 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/11809678_38openalex-snapshot
Optimal Acyclic Edge Colouring of Grid Like Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-39219-2_19openalex-snapshot
On Cartesian Products of Signed Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-04657-0_23openalex-snapshot
Results on Independent Sets in Categorical Products of Graphs, the Ultimate Categorical Independence Ratio and the Ultimate Categorical Independent Domination Ratio
inferred← citeshttps://doi.org/10.1007/978-3-642-11928-6_19openalex-snapshot
Concept Analysis as a Framework for Mining Functional Features from Legacy Code
inferred← citeshttps://doi.org/10.1007/978-3-642-38768-5_42openalex-snapshot
A Linear-Time Algorithm for Computing the Prime Decomposition of a Directed Graph with Regard to the Cartesian Product
inferred← citeshttps://doi.org/10.1007/bfb0037431openalex-snapshot
Recognizing graph products and bundles
inferred← citeshttps://doi.org/10.1007/jhep02(2022)104openalex-snapshot
Lattice fermions as spectral graphs
inferred← citeshttps://doi.org/10.1007/s00373-008-0795-7openalex-snapshot
Hadwiger Number and the Cartesian Product of Graphs
inferred← citeshttps://doi.org/10.1007/s11786-013-0156-7openalex-snapshot
Partial Star Products: A Local Covering Approach for the Recognition of Approximate Cartesian Product Graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(94)90037-xopenalex-snapshot
Strong products of Kneser graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00185-yopenalex-snapshot
On the weak reconstruction of Cartesian-product graphs
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50029-4openalex-snapshot
10.1016/b978-044488002-4/50029-4
inferred← citeshttps://doi.org/10.1016/j.dam.2015.05.022openalex-snapshot
On isomorphism between circulant and Cartesian product of 2 cycles
inferred← citeshttps://doi.org/10.1016/j.dam.2017.04.003openalex-snapshot
Isomorphism between circulants and Cartesian products of cycles
inferred← citeshttps://doi.org/10.1016/j.dam.2019.03.019openalex-snapshot
Modular decomposition of graphs and the distance preserving property
inferred← citeshttps://doi.org/10.1016/j.dam.2021.03.023openalex-snapshot
On Cartesian products of signed graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2005.09.038openalex-snapshot
Recognizing Cartesian products in linear time
inferred← citeshttps://doi.org/10.1016/j.disc.2006.06.019openalex-snapshot
On the Hadwiger's conjecture for graph products
inferred← citeshttps://doi.org/10.1016/j.disc.2010.05.033openalex-snapshot
Optimal acyclic edge colouring of grid like graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2011.08.001openalex-snapshot
Recognizing triangulated Cartesian graph products
inferred← citeshttps://doi.org/10.1016/j.disc.2015.06.001openalex-snapshot
Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time
inferred← citeshttps://doi.org/10.1016/j.finel.2009.02.001openalex-snapshot
Factorization of product graphs for partitioning and domain decomposition
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.11.006openalex-snapshot
Recognizing some complementary products
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.11.038openalex-snapshot
Fast factorization of Cartesian products of (directed) hypergraphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(00)00254-5openalex-snapshot
On recognizing Cartesian graph bundles
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00106-6openalex-snapshot
Unique square property and fundamental factorizations of graph bundles
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00242-7openalex-snapshot
Recognizing Cartesian graph bundles
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00069-7openalex-snapshot
Factoring cardinal product graphs in polynomial time
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00095-1openalex-snapshot
Recognizing Hamming graphs in linear time and space
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00296-7openalex-snapshot
Algorithm for recognizing Cartesian graph bundles
inferred← citeshttps://doi.org/10.1109/cdc.2007.4434915openalex-snapshot
A factorization lemma for the agreement dynamics
inferred← citeshttps://doi.org/10.1109/ictai.2008.149openalex-snapshot
Mining Functional Aspects from Legacy Code
inferred← citeshttps://doi.org/10.1109/ictai.2009.110openalex-snapshot
Using Concepts Analysis for Mining Functional Features from Legacy Code
inferred← citeshttps://doi.org/10.1109/med.2008.4602238openalex-snapshot
On the factorization, observability, and identification of the agreement protocol
inferred← citeshttps://doi.org/10.1137/s0895480197323494openalex-snapshot
Median Graphs and Triangle-Free Graphs
inferred← citeshttps://doi.org/10.1287/ijoc.2016.0724openalex-snapshot
Enumeration and Cartesian Product Decomposition of Alternate Optimal Fluxes in Cellular Metabolism
inferred← citeshttps://doi.org/10.14317/jami.2014.675openalex-snapshot
SOME NEW RESULTS ON IRREGULARITY OF GRAPHS
inferred← citeshttps://doi.org/10.20381/ruor-452openalex-snapshot
Connectedness Properties of Self-Similar Graphs
inferred← citeshttps://doi.org/10.25130/tjps.v25i3.262openalex-snapshot
Chromatic Number and some Properties of Pseudo-Von Neumann Regular graph of Cartesian Product of Rings
inferred← citeshttps://doi.org/10.48550/arxiv.1507.04800openalex-snapshot
Distance preserving graphs and graph products
inferred← citeshttps://doi.org/10.48550/arxiv.1508.07181openalex-snapshot
Fast Factorization of Cartesian products of Hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1705.00119openalex-snapshot
Spanning Tree Auxiliary Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1805.09853openalex-snapshot
Modular Decomposition of Graphs and the Distance Preserving Property
inferred← citeshttps://doi.org/10.48550/arxiv.2111.05725openalex-snapshot
On two graph isomorphism problems
inferred← citeshttps://doi.org/10.5451/unibas-ep45242openalex-snapshot
Graph-Based Factorization of Classical Planning Problems
inferred← citeshttps://doi.org/10.55016/ojs/cdm.v12i1.62598openalex-snapshot
First-Fit coloring of Cartesian product graphs and its defining sets
inferred← citeshttps://doi.org/10.70675/1216b4b1zd441z4267z9465z610d85657e27openalex-snapshot
On various graph coloring problems
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.