✦ LIBER ✦

Polyhedral study of the maximum common induced subgraph problem

✍ Scribed by Breno Piva, Cid Carvalho de Souza

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

A polyhedral study of the maximum edge s

✍ Flavia Bonomo; Javier Marenco; Daniela Saban; Nicolás E. Stier-Moses 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 317 KB

Maximum common subgraph isomorphism algo

✍ John W. Raymond; Peter Willett 📂 Article 📅 2002 🏛 Springer Netherlands 🌐 English ⚖ 152 KB

The parallel complexity of approximation

✍ Raymond Greenlaw 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 814 KB

An Application of Tabu Search Heuristic

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

Parameterized complexity of the induced

✍ Venkatesh Raman; Somnath Sikdar 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 139 KB