An efficient algorithm to solve the conditional covering problem on trapezoid graphs
From MaRDI portal
Publication:410643
DOI10.5402/2011/213084zbMATH Open1238.05260OpenAlexW2155274708WikidataQ58689078 ScholiaQ58689078MaRDI QIDQ410643FDOQ410643
Madhumangal Pal, Anita Pal, Akul Rana
Publication date: 3 April 2012
Published in: ISRN Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.5402/2011/213084
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Distance in graphs (05C12) Combinatorial aspects of packing and covering (05B40)
Cites Work
- Title not available (Why is that?)
- Trapezoid graphs and their coloring
- Title not available (Why is that?)
- On the 2-Chain Subgraph Cover and Related Problems
- Title not available (Why is that?)
- An Analysis of Network Location Problems with Distance Constraints
- Facility location on a tree with maximum distance constraints
- On the structure of trapezoid graphs
- Chaining algorithms for multiple genome comparison
- Conditional covering: greedy heuristics and computational results
- New heuristics for the conditional covering problem
- Algorithms for solving the conditional covering problem on paths
- Dynamic programming algorithms for the conditional covering problem on path and extended star graphs
- A dynamic programming algorithm for the conditional covering problem on tree graphs
- On conditional covering problem
Cited In (5)
- An optimal algorithm to solve 2-neighbourhood covering problem on trapezoid graphs
- Efficient algorithm for the vertex connectivity of trapezoid graphs
- An efficient algorithm to solve connectivity problem on trapezoid graphs
- Title not available (Why is that?)
- Efficient algorithms for the conditional covering problem
This page was built for publication: An efficient algorithm to solve the conditional covering problem on trapezoid graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q410643)
