Edge and node searching problems on trees

Edge and node searching problems on trees

In this paper, we show that there is a natural correspondence between a tree's edge-search strategy and its node-search strategy. By doing so, we simplify the previous linear time algorithm for determining the edge-search number of a tree, and improve the running time of a previous algorithm fo...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Peng, Sheng-Lung, Ho, Chin-Wen, Hsu, Tsan-sheng, Ko, Ming-Tat, Tang, Chuan-Yi
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Applied sciences
Chordal Graph
Computer science
control theory
systems
Exact sciences and technology
Information retrieval. Graph
Internal Vertex
Interval Graph
Linear Time
Reduction Tree
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we show that there is a natural correspondence between a tree's edge-search strategy and its node-search strategy. By doing so, we simplify the previous linear time algorithm for determining the edge-search number of a tree, and improve the running time of a previous algorithm for constructing an edge-search strategy (or plan) for a tree containing n vertices from O(n log n) to O(n) time.
ISSN:0302-9743
1611-3349
DOI:10.1007/BFb0045095