The conditional covering problem on unweighted interval graphs with nonuniform coverage radius

DOI10.1007/S11786-011-0106-1MaRDI QIDQ1948610zbMATH OpenOpenAlexFDO

Authors Akul Rana, Anita Pal, Madhumangal Pal

Publication date 24 April 2013

Published in Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11786-011-0106-1

zbMATH Keywords

distanceanalysis of algorithmsinterval graphdesign of algorithmsmaximal cliqueconditional covering problemminimum cardinality vertex set

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

Recommendations

• The conditional covering problem on unweighted interval graphs
• scientific article; zbMATH DE number 5977185
• On conditional covering problem
• An efficient algorithm to solve the conditional covering problem on trapezoid graphs
• Efficient algorithms for the conditional covering problem

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3706451 (Why is no real title available?)
• A Characterization of Comparability Graphs and of Interval Graphs
• A dynamic programming algorithm for the conditional covering problem on tree graphs
• Algorithms for solving the conditional covering problem on paths
• An Analysis of Network Location Problems with Distance Constraints
• Conditional covering: greedy heuristics and computational results
• Dynamic programming algorithms for the conditional covering problem on path and extended star graphs
• Facility location on a tree with maximum distance constraints
• Incidence matrices and interval graphs
• New heuristics for the conditional covering problem
• On conditional covering problem
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• The conditional covering problem on unweighted interval graphs

Cited in

(7)

• Optimization in business strategy as a part of sustainable economic growth using clique covering of fuzzy graphs
• An efficient algorithm to solve the conditional covering problem on trapezoid graphs
• An optimal algorithm to find minimum k-hop dominating set of interval graphs
• A linear time algorithm to compute square of interval graphs and their colouring
• L(2,1)-labeling of interval graphs
• scientific article; zbMATH DE number 5977185 (Why is no real title available?)
• The conditional covering problem on unweighted interval graphs

This page was built for publication: The conditional covering problem on unweighted interval graphs with nonuniform coverage radius

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1948610)