Tight Bounds for the Maximum Acyclic Subgraph Problem

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.25, Iss.1, 1997-10, pp. : 1-18

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A simulated annealing algorithm for the maximum planar subgraph problem

By Poranen T.

International Journal of Computer Mathematics, Vol. 81, Iss. 5, 2004-05 ,pp. : 555-568

Taylor & Francis Ltd

Access to resources Recommend Favorite

Local approximations for maximum partial subgraph problem

By Monnot J. Paschos V.T. Toulouse S.

Operations Research Letters, Vol. 32, Iss. 3, 2004-05 ,pp. : 217-224

Elsevier

Access to resources Recommend Favorite

Bounds and phase diagram of efficiency at maximum power for tight-coupling molecular motors

By Tu Z.

The European Physical Journal E - Soft Matter, Vol. 36, Iss. 2, 2013-02 ,pp. : 1-5

Springer Publishing Company

Access to resources Recommend Favorite

New Upper Bounds for Maximum Satisfiability

By Niedermeier R. Rossmanith P.

Journal of Algorithms, Vol. 36, Iss. 1, 2000-07 ,pp. : 63-88

Academic Press

Access to resources Recommend Favorite

Tight Performance Bounds of CP-Scheduling on Out-Trees

By Vakhania N.

Journal of Combinatorial Optimization, Vol. 5, Iss. 4, 2001-12 ,pp. : 445-464

Springer Publishing Company

Access to resources Recommend Favorite