Finding Even Subgraphs Even Faster
From MaRDI portal
Publication:5275385
DOI10.4230/LIPIcs.FSTTCS.2015.434zbMath1366.68093OpenAlexW3108844824MaRDI QIDQ5275385
Saket Saurabh, Fahad Panolan, Pranabendu Misra, Prachi Goyal, Geevarghese Philip
Publication date: 13 July 2017
Full work available at URL: http://pubman.mpdl.mpg.de/pubman/item/escidoc:2259376
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (3)
Deterministic Truncation of Linear Matroids ⋮ Editing to Eulerian graphs ⋮ Linear representation of transversal matroids and gammoids parameterized by rank
This page was built for publication: Finding Even Subgraphs Even Faster
