Maximum balanced subgraph problem parameterized above lower bound
Authors:
- R. CrowstonRCR. Crowston
- G. GutinGGG. Gutin
- M. JonesMJM. Jones
- G. MuciacciaGMG. Muciaccia
- 1 November 2013
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 513, 53-64
Abstract
No abstract availableKeywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Note on maximal bisection above tight lower boundInformation Processing Letters, 2010
- Parameterizing above or below guaranteed valuesJournal of Computer and System Sciences, 2009
- Algorithmic and complexity results for decompositions of biological networks into monotone subsystemsBioSystems, 2007
- Fast and Efficient Bright-Field AAPSM Conflict Detection and CorrectionIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2006
- Parameterized algorithms for feedback set problems and their duals in tournamentsTheoretical Computer Science, 2005
- Extracting pure network submatrices in linear programs using signed graphsDiscrete Applied Mathematics, 2004
- A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case boundDiscrete Mathematics, 1986
- On the notion of balance of a signed graph.Michigan Mathematical Journal, 1953