A LINEAR-TIME ALGORITHM FOR FINDING A COMPLETE GRAPH MINOR IN A DENSE GRAPH

被引：1

作者：

Dujmovic, Vida ^{[1
]}

Harvey, Daniel J. ^{[2
]}

Joret, Gwenael ^{[3
]}

Reed, Bruce ^{[4
,5
]}

Wood, David R. ^{[6
]}

机构：

[1] Univ Ottawa, Sch Elect Engn & Comp Sci, Ottawa, ON, Canada

[2] Univ Melbourne, Dept Math & Stat, Melbourne, Vic, Australia

[3] Univ Libre Brussels, Dept Informat, B-1050 Brussels, Belgium

[4] McGill Univ, Sch Comp Sci, Montreal, PQ, Canada

[5] Natl Inst Informat, Kunitachi, Japan

[6] Monash Univ, Sch Math Sci, Melbourne, Vic 3004, Australia

来源：

SIAM JOURNAL ON DISCRETE MATHEMATICS | 2013年 / 27卷 / 04期

基金：

澳大利亚研究理事会; 加拿大自然科学与工程研究理事会;

关键词：

EXTREMAL FUNCTION; PATHS;

D O I：

10.1137/120866725

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Let g(t) be the minimum number such that every graph G with average degree d(G) >= g(t) contains a K-t-minor. Such a function is known to exist, as originally shown by Mader. Kostochka and Thomason independently proved that g(t) is an element of Theta(t root log t). This paper shows that for all fixed epsilon > 0 and fixed sufficiently large t >= t(epsilon), if d(G) >= (2 + epsilon) g(t), then we can find this K-t-minor in linear time. This improves a previous result by Reed and Wood who gave a linear-time algorithm when d(G) >= 2(t-2).

引用

页码：1770 / 1774

页数：5

共 50 条

[1] A Linear-Time Algorithm to Find a Separator in a Graph Excluding a Minor
Reed, Bruce
Wood, David R.
[J]. ACM TRANSACTIONS ON ALGORITHMS, 2009, 5 (04)
[2] AN ALMOST LINEAR-TIME ALGORITHM FOR GRAPH REALIZATION
BIXBY, RE
WAGNER, DK
[J]. MATHEMATICS OF OPERATIONS RESEARCH, 1988, 13 (01) : 99 - 123
[3] A LINEAR-TIME ALGORITHM FOR PROPER INTERVAL GRAPH RECOGNITION
DEFIGUEIREDO, CMH
MEIDANIS, J
DEMELLO, CP
[J]. INFORMATION PROCESSING LETTERS, 1995, 56 (03) : 179 - 184
[4] A LINEAR-TIME ALGORITHM FOR DRAWING A PLANAR GRAPH ON A GRID
CHROBAK, M
PAYNE, TH
[J]. INFORMATION PROCESSING LETTERS, 1995, 54 (04) : 241 - 246
[5] A Linear-time Graph Kernel
Hido, Shohei
Kashima, Hisashi
[J]. 2009 9TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, 2009, : 179 - 188
[6] A SIMPLE LINEAR-TIME ALGORITHM FOR COMPUTING THE CENTER OF AN INTERVAL GRAPH
OLARIU, S
[J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1990, 34 (3-4) : 121 - 128
[7] A Linear-Time Algorithm and Analysis of Graph Relative Hausdorff Distance
Aksoy, Sinan G.
Nowak, Kathleen
Young, Stephen J.
[J]. SIAM JOURNAL ON MATHEMATICS OF DATA SCIENCE, 2019, 1 (04): : 647 - 666
[8] A linear-time algorithm to compute a MAD tree of an interval graph
Dahlhaus, E
Dankelmann, P
Ravi, R
[J]. INFORMATION PROCESSING LETTERS, 2004, 89 (05) : 255 - 259
[9] A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph
Ihm, Insung
Park, Jung-Heum
[J]. DISCRETE APPLIED MATHEMATICS, 2017, 218 : 98 - 112
[10] A linear-time algorithm for computing the intersection of all odd cycles in a graph
Cai, LZ
Schieber, B
[J]. DISCRETE APPLIED MATHEMATICS, 1997, 73 (01) : 27 - 34

← 1 2 3 4 5 →