Approximate search strategies for weighted trees
type: Item
instance of: scholarly article
title: Approximate search strategies for weighted trees
zbMATH Open document ID: 1253.05131
author: Dariusz Dereniowski
published in: Theoretical Computer Science
publication date: 2013-01-07T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 05C22
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 6122459
zbMATH Keywords: connected searching
zbMATH Keywords: edge searching
zbMATH Keywords: graph searching
zbMATH Keywords: node searching
zbMATH Keywords: pathwidth
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.07.006
OpenAlex ID: W2033462251
cites work: Connected graph searching
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Q4035355
cites work: A partial k-arboretum of graphs with bounded treewidth
cites work: Approximation of pathwidth of outerplanar graphs
cites work: Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
cites work: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
cites work: Treewidth and Pathwidth of Permutation Graphs
cites work: Node-searching problem on block graphs
cites work: Connected searching of weighted trees
cites work: From Pathwidth to Connected Pathwidth
cites work: Computing the vertex separation of unicyclic graphs
cites work: The vertex separation and search number of a graph
cites work: Improved approximation algorithms for minimum-weight vertex separators
cites work: A 3-approximation for the pathwidth of Halin graphs
cites work: An annotated bibliography on guaranteed graph searching
cites work: On the pathwidth of chordal graphs
cites work: The vertex separation number of a graph equals its path-width
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: Pathwidth is NP-Hard for Weighted Trees
cites work: Q3477966
cites work: Connected graph searching in chordal graphs
cites work: Graph minors. X: Obstructions to tree-decomposition
cites work: Pathwidth of Circular-Arc Graphs
cites work: Sweeping graphs with large clique number
DOI: 10.1016/J.TCS.2012.07.006
description: scientific article; zbMATH DE number 6122459