Node-searching problem on block graphs

Authors:
Hsin-Hung Chou;Ming-Tat Ko;Chin-Wen Ho;Gen-Huey Chen
Affiliations:
Department of Information Management, Chang Jung Christian University, 396 Chang Jung Road, Section 1, Kway Jen, Tainan 711, Taiwan;Institute of Information Science, Academia Sinica, Taiwan;Department of Computer Science and Information Engineering, National Central University, Taiwan;Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan
Venue:
Discrete Applied Mathematics
Year:
2008

Citing 14
Cited 5

Searching and pebbling

Theoretical Computer Science
Complexity of finding embeddings in a k-tree

SIAM Journal on Algebraic and Discrete Methods
The complexity of searching a graph

Journal of the ACM (JACM)
Min cut is NP-complete for edge weighted trees

Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Monotonicity in graph searching

Journal of Algorithms
Narrowness, pathwidth, and their application in natural language processing

Discrete Applied Mathematics
The vertex separation number of a graph equals its path-width

Information Processing Letters
The pathwidth and treewidth of cographs

SIAM Journal on Discrete Mathematics
On the pathwidth of chordal graphs

Discrete Applied Mathematics - ARIDAM IV and V
The vertex separation and search number of a graph

Information and Computation
Treewidth and Pathwidth of Permutation Graphs

SIAM Journal on Discrete Mathematics
Efficient and constructive algorithms for the pathwidth and treewidth of graphs

Journal of Algorithms
Optimal path cover problem on block graphs

Theoretical Computer Science
Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators

ESA '93 Proceedings of the First Annual European Symposium on Algorithms

Mixed Search Number of Permutation Graphs

FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Edge Search Number of Cographs in Linear Time

FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Pathwidth is NP-Hard for Weighted Trees

FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Edge search number of cographs

Discrete Applied Mathematics
Approximate search strategies for weighted trees

Theoretical Computer Science

Quantified Score

Hi-index	0.05

Visualization

Abstract

The node-searching problem, introduced by Kirousis and Papadimitriou, is equivalent to several important problems, such as the interval thickness problem, the path-width problem, the vertex separation problem, and so on. In this paper, we generalize the avenue concept, originally proposed for trees, to block graphs whereby we design an efficient algorithm for computing both the search numbers and optimal search strategies for block graphs. It answers the question proposed by Peng et al. of whether the node-searching problem on block graphs can be solved in polynomial time.