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

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

Saket Saurabh, M. S. Ramanujan, 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

Linear codes (general theory) (94B05) Combinatorial aspects of matroids and geometric lattices (05B35) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• Unnamed Item
• Fundamentals of parameterized complexity
• On the complexity of approximating extremal determinants in matrices
• On a matroid generalization of graph connectivity
• On the inherent intractability of certain coding problems (Corresp.)
• The intractability of computing the minimum distance of a code
• The Parametrized Complexity of Some Fundamental Problems in Coding Theory
• Connectivity in Matroids

This page was built for publication: On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids