Parameterized complexity of connected even/odd subgraph problems (2014)

First Author: Fomin F

Attributed to: Algorithmic Aspects of Graph Coloring funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1016/j.jcss.2013.07.002

Publication URI: http://dx.doi.org/10.1016/j.jcss.2013.07.002

Type: Journal Article/Review

Parent Publication: Journal of Computer and System Sciences

Issue: 1