ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Finding even subgraphs even faster

Goyal, Prachi and Misra, Pranabendu and Panolan, Fahad and Philip, Geevarghese and Saurabh, Saket (2018) Finding even subgraphs even faster. In: JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 97 . pp. 1-13.

[img] PDF
Jou_Com_Sys_Sci_97_1_2018.pdf - Published Version
Restricted to Registered users only

Download (487kB) | Request a copy
Official URL: http://dx.doi.org/ 10.1016/j.jcss.2018.03.001

Abstract

In the UNDIRECTED EULERIAN EDGE DELETION problem, we are given an undirected graph and an integer k, and the objective is to delete k edges such that the resultant graph is a connected graph in which all the vertices have even degrees. The corresponding problem in digraphs where the resulting graph should be strongly connected and every vertex should have the same in-degree as its out-degree is called DIRECTED EULERIAN EDGE DELETION. In this paper, using the technique of computing representative families of co-graphic matroids we design algorithms which solve these problems in time 2(O(k))n(O(1)), improving the algorithms by Cygan et al. Algorithmica, 2014] and affirmatively answer the open problem posed by them. The crucial insight we bring to these problems is to view the solution as an independent set of a co-graphic matroid. (C) 2018 Elsevier Inc. All rights reserved.

Item Type: Journal Article
Additional Information: Copy right for this article belong to ACADEMIC PRESS INC ELSEVIER SCIENCE, 525 B ST, STE 1900, SAN DIEGO, CA 92101-4495 USA
Department/Centre: Others
Depositing User: Id for Latest eprints
Date Deposited: 27 Aug 2018 14:57
Last Modified: 27 Aug 2018 14:57
URI: http://eprints.iisc.ac.in/id/eprint/60500

Actions (login required)

View Item View Item