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 条

[41] COMPLETING AND EXTENDING SHELLINGS OF VERTEX DECOMPOSABLE COMPLEXES
Coleman, Michaela
Dochtermann, Anton
Geist, Nathan
Oh, Suho
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2022, 36 (02) : 1291 - 1305
[42] A new view toward vertex decomposable graphs
Guo, Jin
Li, Meiyan
Wu, Tongsuo
DISCRETE MATHEMATICS, 2022, 345 (09)
[43] On-line construction of parameterized suffix trees for large alphabets
Lee, Taehyung
Na, Joong Chae
Park, Kunsoo
INFORMATION PROCESSING LETTERS, 2011, 111 (05) : 201 - 207
[44] On-line construction of two-dimensional suffix trees
Giancarlo, R
Guaiana, D
JOURNAL OF COMPLEXITY, 1999, 15 (01) : 72 - 127
[45] On-line coloring of sparse random graphs and random trees
Pittel, B
Weishaar, RS
JOURNAL OF ALGORITHMS, 1997, 23 (01) : 195 - 205
[46] On-line learning of decision trees in problems with unknown dynamics
Núñez, M
Fidalgo, R
Morales, R
MICAI 2005: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2005, 3789 : 443 - 453
[47] Most Recent Match Queries in On-Line Suffix Trees
Larsson, N. Jesper
COMBINATORIAL PATTERN MATCHING, CPM 2014, 2014, 8486 : 252 - 261
[48] On-line maintenance of triconnected components with SPQR-trees
Di, Battista, G.
Tamassia, R.
Algorithmica (New York), 1996, 15 (04):
[49] On-line maintenance of triconnected components with SPQR-trees
DiBattista, G
Tamassia, R
ALGORITHMICA, 1996, 15 (04) : 302 - 318
[50] An efficient algorithm for on-line searching of minima in Monge path-decomposable tridimensional arrays
Garcia, A
Jodra, P
Tejel, J
INFORMATION PROCESSING LETTERS, 1998, 68 (01) : 3 - 9

← 1 2 3 4 5 →