Algorithm 797

DOI10.1145/326147.326153zbMath0966.68161OpenAlexW2035406676WikidataQ113310063 ScholiaQ113310063MaRDI QIDQ4518214

Celso Carneiro Ribeiro, Mauricio G. C. Resende

Publication date: 20 November 2000

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/326147.326153

zbMATH Keywords

greedy randomized adaptive search proceduremaximum planar subgraph problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms ⋮ Algorithm 797

This page was built for publication: Algorithm 797