On-line arbitrarily vertex decomposable trees

被引：20

作者：

Hornak, Mirko

Tuza, Zsolt

Wozniak, Mariusz

机构：

[1] Safarik Univ, Inst Math, Kosice 04001, Slovakia

[2] Hungarian Acad Sci, Inst Comp & Automat, Budapest, Hungary

[3] Univ Veszprem, Dept Comp Sci, H-8201 Veszprem, Hungary

[4] AGH Univ Sci & Technol, Fac Appl Math, PL-30059 Krakow, Poland

来源：

DISCRETE APPLIED MATHEMATICS | 2007年 / 155卷 / 11期

关键词：

arbitrarily vertex decomposable graphs; on-line;

D O I：

10.1016/j.dam.2007.02.011

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

A tree T is arbitrarily vertex decomposable if for any sequence T of positive integers adding up to the order of T there is a sequence of vertex-disjoint subtrees of T whose orders are given by tau. An on-line version of the problem of characterizing arbitrarily vertex decomposable trees is completely solved here. (c) 2007 Elsevier B.V. All rights reserved.

引用

页码：1420 / 1429

页数：10

共 50 条

[31] Multicolor on-line degree Ramsey numbers of trees
Kinnersley, William B.
West, Douglas B.
JOURNAL OF COMBINATORICS, 2012, 3 (01) : 91 - 100
[32] Linear, bidirectional on-line construction of affix trees
Maass, MG
ALGORITHMICA, 2003, 37 (01) : 43 - 74
[33] An On-Line Parallel Algorithm for Node Ranking of Trees
Lee, Chia-Wei
Juan, Justie Su-Tzu
Wu, Tai-Lung
ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, PROCEEDINGS, 2009, 5574 : 384 - +
[34] Average competitive ratios of on-line spanning trees
Bao, F
Mei, AH
Igarashi, Y
INFORMATION PROCESSING LETTERS, 1997, 62 (04) : 213 - 216
[35] Linear Bidirectional On-Line Construction of Affix Trees
Algorithmica, 2003, 37 : 43 - 74
[36] Constructing suffix trees on-line in linear time
Ukkonen, E.
Proceedings of the IFIP World Computer Congress, 1992, 1
[37] Algorithms and models for the on-line vertex-covering - (Extended abstract)
Demange, M
Paschos, VT
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2002, 2573 : 102 - 113
[38] A degree bound on decomposable trees
Barth, D
Fournier, H
DISCRETE MATHEMATICS, 2006, 306 (05) : 469 - 477
[39] ON VERTEX DECOMPOSABLE SIMPLICIAL COMPLEXES AND THEIR ALEXANDER DUALS
Moradi, Somayeh
Khosh-Ahang, Fahjmeh
MATHEMATICA SCANDINAVICA, 2016, 118 (01) : 43 - 56
[40] Complete tripartite graphs arbitrarily decomposable into closed trails
Horak, Mirko
Kockova, Zuzana
GRAPHS '04, 2007, 36 : 71 - +

← 1 2 3 4 5 →