A Solution to the GHI Problem for Best-First Search

DM Breuker; HJ van den Herik; JWHM Uiterwijk; LV Allis

doi:10.1016/S0304-3975(00)00079-7

A Solution to the GHI Problem for Best-First Search

DM Breuker, HJ van den Herik, JWHM Uiterwijk^*, LV Allis

^*Corresponding author for this work

Networks and Strategic Optimization

Research output: Contribution to journal › Article › Academic › peer-review

Original language	English
Pages (from-to)	121-149
Journal	Theoretical Computer Science
Volume	252
Issue number	1-2
DOIs	https://doi.org/10.1016/S0304-3975(00)00079-7
Publication status	Published - 6 Feb 2001

Keywords

graph-history interaction (GHI) problem
best-first search
base-twin algorithm (BTA)

Access to Document

10.1016/S0304-3975(00)00079-7

Cite this

@article{b7e346a529f9486ebf0311901d796a34,

title = "A Solution to the GHI Problem for Best-First Search",

keywords = "graph-history interaction (GHI) problem, best-first search, base-twin algorithm (BTA)",

author = "DM Breuker and {van den Herik}, HJ and JWHM Uiterwijk and LV Allis",

year = "2001",

month = feb,

day = "6",

doi = "10.1016/S0304-3975(00)00079-7",

language = "English",

volume = "252",

pages = "121--149",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier Science",

number = "1-2",

}

TY - JOUR

T1 - A Solution to the GHI Problem for Best-First Search

AU - Breuker, DM

AU - van den Herik, HJ

AU - Uiterwijk, JWHM

AU - Allis, LV

PY - 2001/2/6

Y1 - 2001/2/6

KW - graph-history interaction (GHI) problem

KW - best-first search

KW - base-twin algorithm (BTA)

U2 - 10.1016/S0304-3975(00)00079-7

DO - 10.1016/S0304-3975(00)00079-7

M3 - Article

VL - 252

SP - 121

EP - 149

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1-2

ER -