The balanced connected subgraph problem

DOI10.1016/J.DAM.2020.12.030MaRDI QIDQ6830298zbMATH OpenFDO

Authors Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy

Publication date 4 August 2022

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2020.12.030

zbMATH Keywords

balanced connected subgraphbipartite graphschordal graphsNP-hardnessplanar graphspolynomial algorithmssplit graphstrees

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: The balanced connected subgraph problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6830298)