On the public citation graph
Lower Bounds for the Minimum Spanning Tree Cycle Intersection Problem
0 signed · 11 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.1007/978-1-4419-1291-6openalex-extracted
Optimization for Decision Making: Linear and Quadratic Models
inferredcites →https://doi.org/10.1016/j.cosrev.2009.08.001openalex-extracted
Cycle bases in graphs characterization, algorithms, complexity, and applications
inferredcites →https://doi.org/10.1016/j.dam.2021.01.031openalex-extracted
Minimum Spanning Tree Cycle Intersection problem
inferredcites →https://doi.org/10.1016/j.dam.2022.06.030openalex-extracted
Proof of a Conjecture About Minimum Spanning Tree Cycle Intersection
inferredcites →https://doi.org/10.1137/s0097539792224474openalex-extracted
A Graph-Theoretic Game and Its Application to the k -Server Problem
inferredcites →https://doi.org/10.1145/355984.355988openalex-extracted
Algorithms for Generating Fundamental Cycles in a Graph
inferredcites →https://doi.org/10.1201/9780203497289openalex-extracted
Spanning Trees and Optimization 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.