Sheng-Lung Peng, Ming-Tat Ko, Chin-Wen Ho, Tsan-sheng Hsu, Chuan-Yi Tang  Home/Search
Context
Related
| sinica.edu.tw/pub/TechR...tr97003.ps.gz sinica.edu.tw/LIB/TechR...tr97003.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: sinica.edu.tw/LIB/threebone97 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In the graph searching problem, initially a graph with all edges contaminated is presented. We would like to obtain a state of the graph in which all edges are simultaneously clear by a sequence of moves using searchers. The objective is to achieve the desired state by using the least number of searchers. Two variations of the graph searching problem are considered in this paper. One is the edge searching, in which the clearing of an edge is accomplished by moving a searcher along the edge, and ... (Update)
Active bibliography (related documents): More All
0.4: Computing Optimal Linear Layouts of Trees in Linear Time - Skodinis (1999) (Correct)
0.4: Treewidth and Small Separators for Graphs with Small Chordality - Bodlaender, Thilikos (1995) (Correct)
0.3: Triangulating Graphs without Asteroidal Triples - Möhring (1993) (Correct)
Similar documents based on text: More All
1.4: Contiguous and Internal Graph Searching - Barriere, Fraigniaud, Santoro.. (2002) (Correct)
1.2: Semantic Search on Internet Tabular Information Extraction.. - Wang, Wu, Wang, al. (2000) (Correct)
0.6: A Characterization of the Class of Polygons Searchable by a.. - Park, Lee, Chwa (2000) (Correct)
BibTeX entry: (Update)
@inproceedings{ peng96graph,
author = "Peng and Ko and Ho and Hsu and Tang",
title = "Graph Searching on Chordal Graphs",
booktitle = "{ISAAC}: 7th International Symposium on Algorithms and Computation (formerly {SIGAL} International Symposium on Algorithms), Organized by Special Interest Group on Algorithms ({SIGAL}) of the Information Processing Society of Japan ({IPSJ}) and the Technical Group on Theoretical Foundation of Computing of the Institute of Electronics, Information and Communication Engineers ({IEICE}))",
year = "1996",
url = "citeseer.ist.psu.edu/peng97graph.html" }
Citations (may not include all citations):488 Algorithmic graph theory and perfect graphs (context) - Golumbic - 1980
172 Complexity of finding embeddings in a k-tree (context) - Arnborg, Corneil et al. - 1987
65 The pathwidth and treewidth of cographs - Bodlaender, Moehring - 1993
62 The complexity of searching a graph (context) - Megiddo, Hakimi et al. - 1988
54 Pursuit-evasion in a graph (context) - Parsons - 1976
53 The intersection graphs of subtrees in trees are exactly the.. (context) - Gavril - 1974
53 A characterization of comparability graphs and of interval g.. (context) - Gilmore, Hoffman - 1964
51 The vertex separation and search number of a graph - Ellis, Sudborough et al. - 1994
48 interval graphs and graph planarity using PQ-tree algorithms (context) - Booth, Leuker et al. - 1976
47 Recontamination does not help to search a graph (context) - LaPaugh - 1993
45 Monotonicity in graph searching (context) - Bienstock, Seymour - 1991
40 Treewidth and pathwidth of permutation graphs - Bodlaender, Kloks et al. - 1993
38 Excluding a forest (context) - Robertson, Seymour et al. - 1983
37 The vertex separation number of a graph equals its path-widt.. (context) - Kinnersley - 1992
34 Min cut is NP- complete for edge weighted trees (context) - Monien, Sudborough - 1988
32 Searching and pebbling (context) - Kirousis, Papadimitriou - 1986
32 Interval graph and searching (context) - Kirousis, Papadimitriou - 1985
29 Efficient and constructive algorithms for the pathwidth and .. - Bodlaender, Kloks - 1996
22 Utrecht University (context) - Kloks, Ph et al. - 1993
12 Computing treewidth and minimum fill-in: all you need are th.. (context) - Kloks, Bodlaender et al. - 1993
9 The splittance of a graph (context) - Hammer, Simeone - 1981
8 A linear algorithm for the pathwidth of trees (context) - Scheffler - 1990
7 the pathwidth of chordal graphs (context) - Gustedt - 1993
3 i and Z. Tuza, Narrowness, pathwidth, and their application .. (context) - Korna - 1992
1 Graph problems related to gate matrix layout and PLA folding (context) - Moehring - 1990
Documents on the same site (http://www.iis.sinica.edu.tw/LIB/threebone97.html): More
Face + Hair + Shoulders + Background != Face - Liao, Han, Yu (1997) (Correct)
Wavelet-based Off-line Signature Verification - Deng, Liao, Ho, Tyan (Correct)
High-Level Execution Time Analysis - Wang (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC