@inproceedings{7d2b23f789794f97b446caa8f549c123,
title = "Graph searching on chordal graphs",
abstract = "Two variations of the graph searching problem, edge searching and node searching, are studied on several classes of chordal graphs, which include split graphs, interval graphs and k-starlike graphs.",
author = "Peng, {Sheng Lung} and Ko, {Ming Tat} and Ho, {Chin Wen} and Hsu, {Tsan Sheng} and Tang, {Chuan Yi}",
note = "Publisher Copyright: {\textcopyright} 1996 Springer-Verlag. All rights reserved.; 7th International Symposium on Algorithms and Computation, ISAAC 1996 ; Conference date: 16-12-1996 Through 18-12-1996",
year = "1996",
doi = "10.1007/bfb0009491",
language = "???core.languages.en_GB???",
isbn = "3540620486",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "157--165",
editor = "Tetsuo Asano and Yoshihide Igarashi and Hiroshi Nagamochi and Satoru Miyano and Subhash Suri",
booktitle = "Algorithms and Computation - 7th International Symposium, ISAAC 1996, Proceedings",
}