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 条

[31] Specification and Verification of a Linear-Time Temporal Logic for Graph Transformation
Gadducci, Fabio
Laretto, Andrea
Trotta, Davide
GRAPH TRANSFORMATION, ICGT 2023, 2023, 13961 : 22 - 42
[32] Linear-Time Disk-Based Implicit Graph Search
Korf, Richard E.
JOURNAL OF THE ACM, 2008, 55 (06)
[33] Space limited linear-time graph algorithms on big data
Chen, Jianer
Chu, Zirui
Guo, Ying
Yang, Wei
THEORETICAL COMPUTER SCIENCE, 2024, 993
[34] Linear-Time Subspace Clustering via Bipartite Graph Modeling
Adler, Amir
Elad, Michael
Hel-Or, Yacov
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2015, 26 (10) : 2234 - 2246
[35] A Polynomial Time Algorithm for Finding a Minimally Generalized Linear Interval Graph Pattern
Yamasaki, Hitoshi
Shoudai, Takayoshi
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2009, E92D (02): : 120 - 129
[36] A polynomial time algorithm for finding a minimally generalized linear interval graph pattern
Department of Informatics, Kyushu University, Fukuoka-shi, 819-0395, Japan
IEICE Trans Inf Syst, 2 (120-129):
[37] Image Classification with a Novel Semantic Linear-time Graph Kernel
Luo, Hongchuan
Huang, Zhixing
Xiao, Guoqiang
2015 11TH INTERNATIONAL CONFERENCE ON SEMANTICS, KNOWLEDGE AND GRIDS (SKG), 2015, : 235 - 238
[38] Fuzzy Connectedness Image Segmentation in Graph Cut Formulation: A Linear-Time Algorithm and a Comparative Analysis
Ciesielski, Krzysztof Chris
Udupa, Jayaram K.
Falcao, A. X.
Miranda, P. A. V.
JOURNAL OF MATHEMATICAL IMAGING AND VISION, 2012, 44 (03) : 375 - 398
[39] Complete graph minors and the graph minor structure theorem
Joret, Gwenael
Wood, David R.
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2013, 103 (01) : 61 - 74
[40] Fuzzy Connectedness Image Segmentation in Graph Cut Formulation: A Linear-Time Algorithm and a Comparative Analysis
Krzysztof Chris Ciesielski
Jayaram K. Udupa
A. X. Falcão
P. A. V. Miranda
Journal of Mathematical Imaging and Vision, 2012, 44 : 375 - 398

← 1 2 3 4 5 →