Independent Domination on Tree Convex Bipartite Graphs
From MaRDI portal
Publication:2897988
DOI10.1007/978-3-642-29700-7_12zbMath1304.68064MaRDI QIDQ2897988
Publication date: 16 July 2012
Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-29700-7_12
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Feedback vertex sets on restricted bipartite graphs, Independent dominating set problem revisited, Tractable connected domination for restricted bipartite graphs, Circular Convex Bipartite Graphs: Feedback Vertex Set, Union Closed Tree Convex Sets