21
Views
5
CrossRef citations to date
0
Altmetric
Original Articles

Branch-and-bound techniques for the maximum planar subgraph problemFootnote

Pages 135-147 | Received 04 Jan 1994, Published online: 19 Mar 2007

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (1)

Timo Poranen. (2004) A simulated annealing algorithm for the maximum planar subgraph problem . International Journal of Computer Mathematics 81:5, pages 555-568.
Read now

Articles from other publishers (4)

Markus Chimani, Ivo Hedtke & Tilo Wiedera. (2019) Exact Algorithms for the Maximum Planar Subgraph Problem. ACM Journal of Experimental Algorithmics 24, pages 1-21.
Crossref
Giuseppe F. Italiano. 2016. Encyclopedia of Algorithms. Encyclopedia of Algorithms 806 808 .
Illya V. Hicks. (2007) New facets for the planar subgraph polytope. Networks 51:2, pages 120-132.
Crossref
Giuseppe F. Italiano. 2008. Encyclopedia of Algorithms. Encyclopedia of Algorithms 342 343 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.