On the public citation graph
Finding a Path is Harder than Finding a Tree
0 signed · 27 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-4612-2404-4_12openalex-snapshot
Learning Bayesian Networks is NP-Complete
inferredcites →https://doi.org/10.1007/978-3-540-85066-3_3openalex-snapshot
A Tutorial on Learning with Bayesian Networks
inferredcites →https://doi.org/10.1007/bf00994110openalex-snapshot
A Bayesian Method for the Induction of Probabilistic Networks from Data
inferredcites →https://doi.org/10.1007/bf01584070openalex-snapshot
The traveling-salesman problem and minimum spanning trees: Part II
inferredcites →https://doi.org/10.1023/a:1022623210503openalex-snapshot
Learning Bayesian Networks: The Combination of Knowledge and Statistical Data
inferredcites →https://doi.org/10.1109/tit.1968.1054142openalex-snapshot
Approximating discrete probability distributions with dependence trees
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11821069_27openalex-snapshot
Learning Bayesian Networks Does Not Have to Be NP-Hard
inferred← citeshttps://doi.org/10.1007/978-3-030-30493-5_35openalex-snapshot
On Chow-Liu Forest Based Regularization of Deep Belief Networks
inferred← citeshttps://doi.org/10.1093/bioinformatics/btn505openalex-snapshot
BNFinder: exact and efficient method for learning Bayesian networks
inferred← citeshttps://doi.org/10.1137/22m1489678openalex-snapshot
Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu
inferred← citeshttps://doi.org/10.1145/3406325.3451066openalex-snapshot
Near-optimal learning of tree-structured distributions by Chow-Liu
inferred← citeshttps://doi.org/10.1613/jair.1.13138openalex-snapshot
Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis
inferred← citeshttps://doi.org/10.1613/jair.3744openalex-snapshot
Parameterized Complexity Results for Exact Bayesian Network Structure Learning
inferred← citeshttps://doi.org/10.2118/77608-msopenalex-snapshot
Applied Production Optimization: i-Field
inferred← citeshttps://doi.org/10.24963/ijcai.2020/586openalex-snapshot
Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis
inferred← citeshttps://doi.org/10.3150/21-bej1446openalex-snapshot
Graphical modeling of stochastic processes driven by correlated noise
inferred← citeshttps://doi.org/10.3233/fi-2010-318openalex-snapshot
An Efficient Algorithm for Learning Bayesian Networks from Data
inferred← citeshttps://doi.org/10.3233/ida-150755openalex-snapshot
Expectation maximization based ordering aggregation for improving the K2 structure learning algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.1207.1366openalex-snapshot
Learning Factor Graphs in Polynomial Time & Sample Complexity
inferred← citeshttps://doi.org/10.48550/arxiv.1212.2468openalex-snapshot
Large-Sample Learning of Bayesian Networks is NP-Hard
inferred← citeshttps://doi.org/10.48550/arxiv.1301.0561openalex-snapshot
Finding Optimal Bayesian Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1506.02113openalex-snapshot
Selective Greedy Equivalence Search: Finding Optimal Bayesian Networks Using a Polynomial Number of Score Evaluations
inferred← citeshttps://doi.org/10.48550/arxiv.2005.07568openalex-snapshot
Graphical modeling of stochastic processes driven by correlated errors
inferred← citeshttps://doi.org/10.5555/1036843.1036893openalex-snapshot
PAC-learning bounded tree-width graphical models
inferred← citeshttps://doi.org/10.5555/1248547.1248611openalex-snapshot
Learning Factor Graphs in Polynomial Time and Sample Complexity
inferred← citeshttps://doi.org/10.5555/1953048.2021070openalex-snapshot
Discriminative Learning of Bayesian Networks via Factorized Conditional Log-Likelihood
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.