✦ LIBER ✦

A polyhedral study of the maximum edge subgraph problem

✍ Scribed by Flavia Bonomo; Javier Marenco; Daniela Saban; Nicolás E. Stier-Moses

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The maximum common edge subgraph problem

✍ Laura Bahiense; Gordana Manić; Breno Piva; Cid C. de Souza 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 389 KB

Polyhedral study of the maximum common i

✍ Breno Piva, Cid Carvalho de Souza 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 947 KB

An Application of Tabu Search Heuristic

✍ Elder Magalhães Macambira 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 98 KB

Edge-maximal triangulated subgraphs and

✍ Jue Xue 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 855 KB

On maximum number of edges in a spanning

✍ Dengxin Li; Deying Li; Jingzhong Mao 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 168 KB

A linear programming formulation for the

✍ Denis Cornaz 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 238 KB