scientific article
From MaRDI portal
Publication:2957516
DOI10.4230/LIPIcs.FSTTCS.2012.400zbMath1354.68116arXiv1207.3586MaRDI QIDQ2957516
No author found.
Publication date: 26 January 2017
Full work available at URL: https://arxiv.org/abs/1207.3586
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (5)
Maximum balanced subgraph problem parameterized above lower bound ⋮ Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound ⋮ \textsc{Max-Cut} parameterized above the Edwards-Erdős bound ⋮ Linear kernels and linear-time algorithms for finding large cuts ⋮ Acyclic Digraphs
This page was built for publication:
