Restricted Bipartite Graphs: Comparison and Hardness Results

DOI10.1007/978-3-319-07956-1_22zbMath1445.05073OpenAlexW213040184MaRDI QIDQ5251649

Tian Liu

Publication date: 20 May 2015

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-07956-1_22

zbMATH Keywords

treewidthNP-completenessfeedback vertex setchordal bipartite graphstree convex bipartite graphsperfect elimination bipartite graphsconvex bipartite graphscircular convex bipartite graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (10)

Solving problems on generalized convex graphs via mim-width ⋮ Domination in some subclasses of bipartite graphs ⋮ Union Closed Tree Convex Sets ⋮ Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs ⋮ Induced Matching in Some Subclasses of Bipartite Graphs ⋮ 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 ⋮ Unnamed Item ⋮ Hardness and structural results for half-squares of restricted tree convex bipartite graphs

This page was built for publication: Restricted Bipartite Graphs: Comparison and Hardness Results