English  |  正體中文  |  简体中文  |  Items with full text/Total items : 26999/38800
Visitors : 2401851      Online Users : 57
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/27833

Title: Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs
Authors: Ching-Chi Lin;Gerard J. Chang;Gen-Huey Chen
Contributors: NTOU:Department of Computer Science and Engineering
Keywords: circular-arc graph;directed path graph;interval graph;locally connected spanning tree;proper circular-arc graph;strongly chordal graph
Date: 2007
Issue Date: 2011-10-21T02:34:10Z
Publisher: Discrete Mathematics
Abstract: Abstract:A locally connected spanning tree of a graph G is a spanning tree T of G such that the set of all neighbors of v in T induces a connected subgraph of G for every v ? V (G). The purpose of this paper is to give linear-time algorithms for finding locally connected spanning trees on strongly chordal graphs and proper circular-arc graphs, respectively.
Relation: 307(2), pp.206-215
URI: http://ntour.ntou.edu.tw/handle/987654321/27833
Appears in Collections:[資訊工程學系] 期刊論文

Files in This Item:

There are no files associated with this item.

All items in NTOUR are protected by copyright, with all rights reserved.


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback