scientific article; zbMATH DE number 3807643

MaRDI QIDQ4750667zbMATH OpenFDO

Authors Peter Eades, Les R. Foulds, J. W. Giffin

Publication date 1982

zbMATH Keywords

heuristic algorithmmaximal planar graphwheel expansions

Mathematics Subject Classification ID

Designs and configurations (05B99) Extremal problems in graph theory (05C35) Graph theory (05C99)

Cited in

(7)

• The facility layout problem
• An algorithm for quadratic assignment problems
• An interactive layout heuristic based on hexagonal adjacency graphs
• Location and layout planning. A survey
• Two new heuristic algorithms for the maximal planar layout problem
• Maximum planar subgraphs and nice embeddings: Practical layout tools
• A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4750667)