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 条
  • [31] Reconfiguration graph for vertex colourings of weakly chordal graphs
    Feghali, Carl
    Fiala, Jiri
    DISCRETE MATHEMATICS, 2020, 343 (03)
  • [32] RECONFIGURATION GRAPH FOR VERTEX COLOURINGS OF WEAKLY CHORDAL GRAPHS
    Feghali, C.
    Fiala, J.
    ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, 2019, 88 (03): : 667 - 671
  • [33] The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation
    Ekim, Tinaz
    Shalom, Mordechai
    Seker, Oylum
    ANALYSIS OF EXPERIMENTAL ALGORITHMS, SEA2 2019, 2019, 11544 : 21 - 34
  • [34] The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation
    Ekim, Tinaz
    Shalom, Mordechai
    Seker, Oylum
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2021, 41 (03) : 710 - 735
  • [35] The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation
    Tınaz Ekim
    Mordechai Shalom
    Oylum Şeker
    Journal of Combinatorial Optimization, 2021, 41 : 710 - 735
  • [36] Acyclic Matching in Some Subclasses of Graphs
    Panda, B. S.
    Chaudhary, Juhi
    COMBINATORIAL ALGORITHMS, IWOCA 2020, 2020, 12126 : 409 - 421
  • [37] Acyclic matching in some subclasses of graphs
    Panda, B. S.
    Chaudhary, Juhi
    THEORETICAL COMPUTER SCIENCE, 2023, 943 : 36 - 49
  • [38] Domination in some subclasses of bipartite graphs
    Pandey, Arti
    Panda, B. S.
    DISCRETE APPLIED MATHEMATICS, 2019, 252 : 51 - 66
  • [39] Domination in Some Subclasses of Bipartite Graphs
    Pandey, Arti
    Panda, B. S.
    ALGORITHMS AND DISCRETE APPLIED MATHEMATICS (CALDAM 2015), 2015, 8959 : 169 - 180
  • [40] ORDERED HAMILTONICITY FOR SOME CHORDAL RING GRAPHS
    Sherman, David
    Tsai, Ming
    Lin, Cheng-Kuan
    Liptak, Laszlo
    Cheng, Eddie
    Tan, Jimmy J. M.
    Hsu, Lih-Hsing
    JOURNAL OF INTERCONNECTION NETWORKS, 2010, 11 (3-4) : 157 - 174
12345