On the public citation graph

Synthesis of function-described graphs

0 signed · 18 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.1007/3-540-63507-6_263openalex-snapshot

Function-described graphs applied to 3D object representation

inferredcites →https://doi.org/10.1109/21.260671openalex-snapshot

Incremental clustering of attributed graphs

inferredcites →https://doi.org/10.1109/tpami.1985.4767707openalex-snapshot

Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition

inferredcites →https://doi.org/10.1109/tsmc.1979.4310127openalex-snapshot

Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis

inferredcites →https://doi.org/10.1109/tsmc.1983.6313167openalex-snapshot

A distance measure between attributed relational graphs for pattern recognition

inferredcites →https://doi.org/10.1142/0580openalex-snapshot

Syntactic and Structural Pattern Recognition — Theory and Applications

inferredcites →https://doi.org/10.1142/9789812814913_0008openalex-snapshot

RANDOM 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/3-540-44522-6_29openalex-snapshot

Distance between Attributed Graphs and Function-Described Graphs Relaxing 2nd Order Restrictions

inferred← citeshttps://doi.org/10.1007/978-3-319-49055-7_47openalex-snapshot

Graph Edit Distance or Graph Edit Pseudo-Distance?

inferred← citeshttps://doi.org/10.1016/s0031-3203(01)00066-8openalex-snapshot

Graph-based representations and techniques for image processing and image analysis

inferred← citeshttps://doi.org/10.1016/s0031-3203(02)00107-3openalex-snapshot

Function-described graphs for modelling objects represented by sets of attributed graphs

inferred← citeshttps://doi.org/10.1016/s0031-3203(02)00227-3openalex-snapshot

First order Gaussian graphs for efficient structure classification

inferred← citeshttps://doi.org/10.1109/icdar.2001.953759openalex-snapshot

Fine-grained document genre classification using first order random graphs

inferred← citeshttps://doi.org/10.1109/icpr.2000.906212openalex-snapshot

Efficient algorithms for matching attributed graphs and function-described graphs

inferred← citeshttps://doi.org/10.1109/icpr.2000.906248openalex-snapshot

Clustering of attributed graphs and unsupervised synthesis of function-described graphs

inferred← citeshttps://doi.org/10.1109/icpr.2002.1048257openalex-snapshot

Modelling and recognising 3D-objects described by multiple views using function-described graphs

inferred← citeshttps://doi.org/10.48550/arxiv.1605.02929openalex-snapshot

Function-Described Graphs for Structural Pattern Recognition

inferred← citeshttps://doi.org/10.5821/dissertation-2117-93497openalex-snapshot

Environment learning for indoor mobile robots

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.