A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph
From MaRDI portal
Publication:5408591
DOI10.1137/120866725zbMath1285.05164arXiv1202.2624OpenAlexW2162357422MaRDI QIDQ5408591
Daniel J. Harvey, David R. Wood, Gwenaël Joret, Vida Dujmović, Bruce A. Reed
Publication date: 10 April 2014
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1202.2624
Related Items (1)
This page was built for publication: A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph