Average-case analysis of best-first search in two representative directed acyclic graphs

, &
Artificial Intelligence 155 (1-2):183-206 (2004)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2004.01.001

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

A transformational characterization of Markov equivalence for directed acyclic graphs with latent variables.Jiji Zhang & Peter Spirtes - unknown
Relating graphical frameworks : undirected, directed acyclic and chain graph models.Chris Meek - unknown
Directed cyclic graphs, conditional independence, and non-recursive linear structural equation models.Peter Spirtes - unknown
A characterization of Markov qquivalence classes for directed acyclic graphs with latent variables.Jiji Zhang - unknown
Towards characterizing Markov equivalence classes for directed acyclic graphs with latent variables.Ayesha Ali, Thomas Richardson, Peter Spirtes & Jiji Zhang - unknown
A Transformational Characterization of Markov Equivalence for Directed Maximal Ancestral Graphs.Jiji Zhang & Peter Spirtes - unknown
Calculating TETRAD Constraints Implied by Directed Acyclic Graphs.Peter Spirtes - unknown
Decomposition of structural learning about directed acyclic graphs.Xianchao Xie, Zhi Geng & Qiang Zhao - 2006 - Artificial Intelligence 170 (4-5):422-439.
Betweenness centrality measures for directed graphs.D. R. White & S. P. Borgatti - unknown
NP-Hardness and fixed-parameter tractability of realizing degree sequences with directed acyclic graphs.Sepp Hartung & André Nichterlein - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 283--292.
Reachability is harder for directed than for undirected finite graphs.Miklos Ajtai & Ronald Fagin - 1990 - Journal of Symbolic Logic 55 (1):113-150.
Hopf Bifurcations in Directed Acyclic Networks of Linearly Coupled Hindmarsh–Rose Systems.N. Verdière, V. Lanza & N. Corson - 2016 - Acta Biotheoretica 64 (4):375-402.
A logical approach to context-specific independence.Jukka Corander, Antti Hyttinen, Juha Kontinen, Johan Pensar & Jouko Väänänen - 2019 - Annals of Pure and Applied Logic 170 (9):975-992.
Duplication of directed graphs and exponential blow up of proofs.A. Carbone - 1999 - Annals of Pure and Applied Logic 100 (1-3):1-67.
Systems without a graphical causal representation.Daniel M. Hausman, Reuben Stern & Naftali Weinberger - 2014 - Synthese 191 (8):1925-1930.

Analytics

Added to PP
2020-12-22

Downloads
5 (#1,463,568)

6 months
3 (#880,460)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Performance of linear-space search algorithms.Weixiong Zhang & Richard E. Korf - 1995 - Artificial Intelligence 79 (2):241-292.
Probabilistic analysis of the complexity of A∗.Nam Huyn, Rina Dechter & Judea Pearl - 1980 - Artificial Intelligence 15 (3):241-254.

View all 6 references / Add more references