✦ LIBER ✦

Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs

✍ Scribed by R. B. Borie

Publisher: Springer
Year: 1995
Tongue: English
Weight: 837 KB
Volume: 14
Category: Article
ISSN: 0178-4617
DOI: 10.1007/bf01293664

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polynomial time algorithms for Hamiltoni

Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs

✍ Haiko Müller; Falk Nicolai 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 445 KB

On some algorithmic problems of multicri

On some algorithmic problems of multicriterion optimization on graphs

✍ V.A. Emelichev; V.A. Perepelitsa 📂 Article 📅 1989 🏛 Elsevier Science ⚖ 983 KB

Polynomial-time algorithms for solving a

Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs

✍ Siqian Shen; J. Cole Smith 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 367 KB 👁 1 views

Automated Generation of Search Tree Algo

Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems

✍ Jens Gramm; Jiong Guo; Falk Hüffner; Rolf Niedermeier 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 255 KB

Polynomial algorithms for the maximum st

Polynomial algorithms for the maximum stable set problem on particular classes of P5-free graphs

✍ Raffaele Mosca 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 588 KB

The Maximum Stable Set Problem (MS) is a well-known NP-hard problem. A popular research stream considers classes of graphs, defined in terms of forbidden subgraphs, in which either MS is NP-hard or can be solved by polynomial algorithms. In this paper we focus on three of these classes: in one of th

A polynomial-time algorithm for linear o

A polynomial-time algorithm for linear optimization based on a new class of kernel functions

✍ M. El Ghami; I. Ivanov; J.B.M. Melissen; C. Roos; T. Steihaug 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 721 KB