Union closed tree convex sets
From MaRDI portal
Publication:3452566
DOI10.1007/978-3-319-19647-3_19zbMATH Open1408.05133OpenAlexW1203493243MaRDI QIDQ3452566FDOQ3452566
Publication date: 12 November 2015
Published in: Frontiers in Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-19647-3_19
Recommendations
Cites Work
- Title not available (Why is that?)
- Graph Classes: A Survey
- Independent domination on tree convex bipartite graphs
- Two Hardness Results on Feedback Vertex Sets
- Perfect Elimination and Chordal Bipartite Graphs
- A review of tree convex sets test
- Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs
- Restricted Bipartite Graphs: Comparison and Hardness Results
- Set cover, set packing and hitting set for tree convex and tree-like set systems
- Degrees of acyclicity for hypergraphs and relational database schemes
- Tree Convex Bipartite Graphs: $\mathcal{NP}$ -Complete Domination, Hamiltonicity and Treewidth
Cited In (4)
This page was built for publication: Union closed tree convex sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452566)