The complexity of searching implicit graphs

Artificial Intelligence 86 (1):171-188 (1996)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0004-3702(96)00014-8

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,923

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

Complexity of networks II: The set complexity of edge‐colored graphs.Tomasz M. Ignac, Nikita A. Sakhanenko & David J. Galas - 2012 - Complexity 17 (5):23-36.
An efficient algorithm for searching implicit AND/OR graphs with cycles.P. Jiménez & C. Torras - 2000 - Artificial Intelligence 124 (1):1-30.
Complexity of networks I: The set‐complexity of binary graphs.Nikita A. Sakhanenko & David J. Galas - 2011 - Complexity 17 (2):51-64.
Emergence of geometry in a combinatorial universe.Paul Baird - 2013 - Journal of Geometry and Physics 74:185-195.
Computing the Weighted Isolated Scattering Number of Interval Graphs in Polynomial Time.Fengwei Li, Xiaoyan Zhang, Qingfang Ye & Yuefang Sun - 2019 - Complexity 2019:1-8.
The Domination Complexity and Related Extremal Values of Large 3D Torus.Zehui Shao, Jin Xu, S. M. Sheikholeslami & Shaohui Wang - 2018 - Complexity 2018:1-8.
Complexity and non-commutativity of learning operations on graphs.Harald Atmanspacher - manuscript
Some natural decision problems in automatic graphs.Dietrich Kuske & Markus Lohrey - 2010 - Journal of Symbolic Logic 75 (2):678-710.
Spectral Complexity of Directed Graphs and Application to Structural Decomposition.Igor Mezić, Vladimir A. Fonoberov, Maria Fonoberova & Tuhin Sahai - 2019 - Complexity 2019:1-18.
An Algorithm for Fast Recovery of Sparse Causal Graphs.Peter Spirtes - unknown
An admissible and optimal algorithm for searching AND/OR graphs.C. L. Chang & J. R. Slagle - 1971 - Artificial Intelligence 2 (2):117-128.
Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search.P. P. Chakrabarti - 1994 - Artificial Intelligence 65 (2):329-345.
1‐Pointer Automata Searching Finite Plane Graphs.Armin Hemmerling - 1986 - Mathematical Logic Quarterly 32 (13‐16):245-256.
Synthetic analysis: How science combats complexity.Sunny Auyang - manuscript
1‐Pointer Automata Searching Finite Plane Graphs.Armin Hemmerling - 1986 - Mathematical Logic Quarterly 32 (13-16):245-256.

Analytics

Added to PP
2020-12-22

Downloads
5 (#1,558,901)

6 months
3 (#1,042,169)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Add more references