On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids

DOI10.1007/978-3-319-21840-3_47zbMath1451.68139MaRDI QIDQ3449854

M. S. Ramanujan, Saket Saurabh, Fahad Panolan

Publication date: 30 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21840-3_47

Mathematics Subject Classification ID

94B05: Linear codes (general theory)

05B35: Combinatorial aspects of matroids and geometric lattices

68Q27: Parameterized complexity, tractability and kernelization