The 0–1 inverse maximum independent set problem on forests and unicyclic graphs

DOI10.1142/S1793830916500191zbMath1342.90169OpenAlexW2276044171MaRDI QIDQ3178148

Zhao Zhang, Shuaifu Liu

Publication date: 8 July 2016

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830916500191

zbMATH Keywords

algorithmindependent setinverse combinatorial optimization

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• The 0-1 inverse maximum stable set problem
• On an instance of the inverse shortest paths problem
• The complexity analysis of the inverse center location problem
• Inverse combinatorial optimization: a survey on problems, methods, and results
• On inverse traveling salesman problems
• The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments
• Some Inverse Traveling Salesman Problems

This page was built for publication: The 0–1 inverse maximum independent set problem on forests and unicyclic graphs