On the public citation graph

String Coding of Trees with Locality and Heritability

0 signed · 20 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/(sici)1097-0037(199709)30:2<91::aid-net3>3.0.co;2-fopenalex-snapshot
A note on genetic algorithms for degree-constrained spanning tree problems
inferredcites →https://doi.org/10.1007/978-3-540-24698-5_38openalex-snapshot
A Unified Approach to Coding Labeled Trees
inferredcites →https://doi.org/10.1007/b95852openalex-snapshot
LATIN 2004 : theoretical informatics : 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004 : proceedings
inferredcites →https://doi.org/10.1017/cbo9780511703799.010openalex-snapshot
A theorem on trees
inferredcites →https://doi.org/10.1017/cbo9781107279667.013openalex-snapshot
Introduction to algorithms

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-540-74450-4_37openalex-snapshot
A Bijective Code for k-Trees with Linear Time Encoding and Decoding
inferred← citeshttps://doi.org/10.1007/978-3-642-01970-8_60openalex-snapshot
Parallel Algorithms for Dandelion-Like Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-11440-3_16openalex-snapshot
Parallel Algorithms for Encoding and Decoding Blob Code
inferred← citeshttps://doi.org/10.1007/s00224-008-9131-0openalex-snapshot
Bijective Linear Time Coding and Decoding for k-Trees
inferred← citeshttps://doi.org/10.1007/s00500-016-2436-zopenalex-snapshot
A simulation-based quantitative analysis on the topological heritability of Dandelion-encoded meta-heuristics for tree optimization problems
inferred← citeshttps://doi.org/10.1016/j.jpdc.2010.07.003openalex-snapshot
Unified parallel encoding and decoding algorithms for Dandelion-like codes
inferred← citeshttps://doi.org/10.1016/j.swevo.2019.01.007openalex-snapshot
A node-depth phylogenetic-based artificial immune system for multi-objective Network Design Problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.03.009openalex-snapshot
On coding labeled trees
inferred← citeshttps://doi.org/10.1109/cec.2006.1688567openalex-snapshot
Recent Advances in the Study of the Dandelion Code, Happy Code, and Blob Code Spanning Tree Representations
inferred← citeshttps://doi.org/10.1109/inista.2015.7276763openalex-snapshot
On the heritability of dandelion-encoded harmony search heuristics for tree optimization problems
inferred← citeshttps://doi.org/10.1109/tcyb.2020.3005047openalex-snapshot
A New Crossover Mechanism for Genetic Algorithms for Steiner Tree Optimization
inferred← citeshttps://doi.org/10.1109/tevc.2008.2008799openalex-snapshot
On the Bias and Performance of the Edge-Set Encoding
inferred← citeshttps://doi.org/10.1145/1276958.1277207openalex-snapshot
Some novel locality results for the blob code spanning tree representation
inferred← citeshttps://doi.org/10.11606/t.55.2019.tde-29082019-141240openalex-snapshot
A data structure for spanning tree optimization problems
inferred← citeshttps://doi.org/10.37236/973openalex-snapshot
Developing New Locality Results for the Prüfer Code using a Remarkable Linear-Time Decoding Algorithm
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.