Independent Domination on Tree Convex Bipartite Graphs
From MaRDI portal
Publication:2897988
DOI10.1007/978-3-642-29700-7_12zbMath1304.68064OpenAlexW2145337305MaRDI 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
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (20)
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 ⋮ Circular convex bipartite graphs: feedback vertex sets ⋮ Union Closed Tree Convex Sets ⋮ Dynamic matchings in left vertex weighted convex bipartite graphs ⋮ Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs ⋮ Counting dominating sets in some subclasses of bipartite graphs ⋮ Feedback vertex sets on restricted bipartite graphs ⋮ Some new algorithmic results on co-secure domination in graphs ⋮ Induced Matching in Some Subclasses of Bipartite Graphs ⋮ Independent dominating set problem revisited ⋮ Maximum Edge Bicliques in Tree Convex Bipartite Graphs ⋮ Solving problems on generalized convex graphs via mim-width ⋮ Maximum weight induced matching in some subclasses of bipartite graphs ⋮ Counting independent sets in tree convex bipartite graphs ⋮ Dominating induced matching in some subclasses of bipartite graphs ⋮ Circular Convex Bipartite Graphs: Feedback Vertex Set ⋮ Tractable connected domination for restricted bipartite graphs ⋮ Linear algorithms for red and blue domination in convex bipartite graphs
This page was built for publication: Independent Domination on Tree Convex Bipartite Graphs
