Mixed searching and proper-path-width
type: Item
instance of: scholarly article
title: Mixed searching and proper-path-width
zbMATH Open document ID: 0873.68148
DOI: 10.1016/0304-3975(94)00160-K
author: Atsushi Takahashi
author: Shuichi Ueno
author: Yoji Kajitani
published in: Theoretical Computer Science
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 986073
MaRDI profile type: Publication
cites work: Complexity of Finding Embeddings in a k-Tree
cites work: Monotonicity in graph searching
cites work: Q4694755
cites work: Q4036592
cites work: The NP-completeness column: An ongoing guide
cites work: Interval graphs and searching
cites work: Searching and pebbling
cites work: Recontamination does not help to search a graph
cites work: The complexity of searching a graph
cites work: Q3477966
cites work: Q4159394
cites work: Graph minors. I. Excluding a forest
cites work: Graph minors. XIII: The disjoint paths problem
cites work: Graph minors. XX: Wagner's conjecture
cites work: Q3197842
cites work: Minimal acyclic forbidden minors for the family of graphs with bounded path-width
Wikidata QID: Q131836843
description: scientific article; zbMATH DE number 986073