Independent Domination on Tree Convex Bipartite Graphs

DOI10.1007/978-3-642-29700-7_12zbMath1304.68064MaRDI QIDQ2897988

Yu Song, Tian Liu, Ke Xu

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

Mathematics Subject Classification ID

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

Maximum Edge Bicliques in Tree Convex Bipartite Graphs, Dominating induced matching in some subclasses of bipartite graphs, Circular convex bipartite graphs: feedback vertex sets, Dynamic matchings in left vertex weighted convex bipartite graphs, Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs, Feedback vertex sets on restricted bipartite graphs, Independent dominating set problem revisited, Counting independent sets in tree convex bipartite graphs, Solving problems on generalized convex graphs via mim-width, Counting independent sets and maximal independent sets in some subclasses of bipartite graphs, Domination in some subclasses of bipartite graphs, Maximum weight induced matching in some subclasses of bipartite graphs, Linear algorithms for red and blue domination in convex bipartite graphs, Tractable connected domination for restricted bipartite graphs, Counting dominating sets in some subclasses of bipartite graphs, Circular Convex Bipartite Graphs: Feedback Vertex Set, Induced Matching in Some Subclasses of Bipartite Graphs, Union Closed Tree Convex Sets