Convex graph covers

MaRDI QIDQ1650336zbMATH OpenFDO

Authors Radu Buzatu, Sergiu Cataranciuc

Publication date 3 July 2018

Published in Computer Science Journal of Moldova (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International

Full work available at URL http://www.math.md/publications/csjm/issues/v23-n3/11974/

zbMATH Keywords

graphsconvexityconvex partitionsconvex covers

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On the computational complexity of optimization convex covering problems of graphs
• On nontrivial covers and partitions of graphs by convex sets
• Convex covers of graphs
• Covering graphs with convex sets and partitioning graphs into convex sets
• Binary linear programming approach to graph convex covering problems

Cited in

(12)

• scientific article; zbMATH DE number 4083674 (Why is no real title available?)
• On the computational complexity of optimization convex covering problems of graphs
• Convex covers of graphs
• Integer programming models and polyhedral study for the geodesic classification problem on graphs
• Binary linear programming approach to graph convex covering problems
• The geodesic classification problem on graphs
• Nontrivial convex covers of trees
• On nontrivial covers and partitions of graphs by convex sets
• Constructing concise convex covers via clique covers (CG challenge)
• Covering undirected graphs by convex sets
• Covering graphs with convex sets and partitioning graphs into convex sets
• scientific article; zbMATH DE number 7525863 (Why is no real title available?)

This page was built for publication: Convex graph covers

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