Maximum balanced subgraph problem parameterized above lower bound

2013/11/01 by Robert Crowston, R. Crowston, Gregory Gutin +5 · 15 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithms and Data Compression #Combinatorics #Complexity and Algorithms in Graphs #Discrete mathematics #Graph #Mathematics #Parameterized complexity #Upper and lower bounds #Vertex (graph theory) #Vertex connectivity

paper · doi:10.1016/j.tcs.2013.10.026

published in Theoretical Computer Science 513, 53-64 (Elsevier BV)

crossref issued 2013/11/01 · crossref published 2013/11/01 · crossref published-print 2013/11/01 · openalex publication_date 2013/11/01 · crossref created 2013/11/04 · crossref deposited 2018/10/10 · openalex created_date 2025/10/10 · crossref indexed 2026/03/19 · openalex updated_date 2026/07/29

Citations

• Invitation to Fixed-Parameter Algorithms
• Simultaneously Satisfying Linear Equations Over \mathbbF₂: MaxLin2 and Max-r-Lin2 Parameterized Above Average
• Parameterized Complexity Theory
• A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound
• Max-Cut Parameterized Above the Edwards-Erdős Bound
• Parameterized Complexity

Cited by

• Maximum cut [wikipedia]