Graph Searching on Some Subclasses of Chordal Graphs

被引：0

作者：

S.-L. Peng

C. Y. Tang

M.-T. Ko

C.-W. Ho

T.-s. Hsu

机构：

[1] National Tsing Hua University,

[2] Taiwan. dr818303@cs.nthu.edu.tw,undefined

[3] cytang@cs.nthu.edu.tw.,undefined

[4] Institute of Information Science,undefined

[5] Academia Sinica,undefined

[6] Nankang,undefined

[7] Taipei,undefined

[8] Taiwan. mtko@iis.sinica.edu.tw,undefined

[9] tshsu@iis.sinica.edu.tw.,undefined

[10] National Central University,undefined

[11] Taiwan. hocw@csie.ncu.edu.tw.,undefined

来源：

Algorithmica | 2000年 / 27卷

关键词：

Key words. Graph searching problem, Edge searching, Node searching, Star-like graphs, Split graphs, Interval graphs.;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

In the graph-searching problem, initially a graph with all the edges contaminated is presented. The objective is to obtain a state of the graph in which all the edges are simultaneously cleared by using the least number of searchers. Two variations of the graph-searching problem are considered. One is edge searching, in which an edge is cleared by moving a searcher along this edge, and the other is node searching, in which an edge is cleared by concurrently having searchers on both of its two endpoints.

引用

页码：395 / 426

页数：31

共 50 条

[21] Clique tree generalization and new subclasses of chordal graphs
Kumar, PS
Madhavan, CEV
DISCRETE APPLIED MATHEMATICS, 2002, 117 (1-3) : 109 - 131
[22] Exploring Dominating Functions and Their Complexity in Subclasses of Weighted Chordal Graphs and Bipartite Graphs
Lee, Chuan-Min
MATHEMATICS, 2025, 13 (03)
[23] SOME PROPERTIES OF CHORDAL GRAPHS
BAKONYI, M
CONSTANTINESCU, T
COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 1990, 310 (06): : 307 - 309
[24] Distance paired-domination problems on subclasses of chordal graphs
Chen, Lei
Lu, Changhong
Zeng, Zhenbing
THEORETICAL COMPUTER SCIENCE, 2009, 410 (47-49) : 5072 - 5081
[25] The clique-separator graph for chordal graphs
Ibarra, Louis
DISCRETE APPLIED MATHEMATICS, 2009, 157 (08) : 1737 - 1749
[26] Some characterizations of doubly chordal graphs
Mahnhoon Lee
Changhwa Kim
Korean Journal of Computational & Applied Mathematics, 1998, 5 (1): : 65 - 71
[27] Edge clique graphs and some classes of chordal graphs
Discrete Math, 1-3 (31-39):
[28] Edge clique graphs and some classes of chordal graphs
Cerioli, MR
Szwarcfiter, JL
DISCRETE MATHEMATICS, 2002, 242 (1-3) : 31 - 39
[29] Intersection graphs of induced subtrees of any graph and a generalization of chordal graphs
De Caria, Pablo
DISCRETE APPLIED MATHEMATICS, 2022, 323 : 171 - 183
[30] On the proper interval completion problem within some chordal subclasses
Dross, Francois
Hilaire, Claire
Koch, Ivo
Leoni, Valeria
Pardal, Nina
Pujato, Maria Ines Lopez
dos Santos, Vinicius Fernandes
DISCRETE MATHEMATICS, 2025, 348 (01)

← 1 2 3 4 5 →