Linear programming and primal-dual problems in graph theory

MaRDI QIDQ2868311zbMATH OpenFDO

Authors Mehdi Alaeiyan, Saeid Mohammadian

Publication date 16 December 2013

Published in Acta Universitatis Apulensis. Mathematics - Informatics (Search for Journal in Brave)

zbMATH Keywords

dominating setsedge coververtex cover

Mathematics Subject Classification ID

Linear programming (90C05) Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Graph polynomials
• scientific article; zbMATH DE number 1124594
• scientific article; zbMATH DE number 59833

Cited in

(3)

• scientific article; zbMATH DE number 3908486 (Why is no real title available?)
• Graph polynomials
• Linear programming and the worst-case analysis of greedy algorithms on cubic graphs

This page was built for publication: Linear programming and primal-dual problems in graph theory

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