An efficient heuristic for identifying a maximum weight planar subgraph
- 1 January 1982
- book chapter
- Published by Springer Nature
- p. 239-251
- https://doi.org/10.1007/bfb0061982
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Planarity and duality of finite and infinite graphsJournal of Combinatorial Theory, Series B, 1980
- Hospital Layout as a Quadratic Assignment ProblemJournal of the Operational Research Society, 1977
- A Strategy for Solving the Plant Layout ProblemJournal of the Operational Research Society, 1976
- Campus building arrangement using topazTransportation Research, 1972
- Quadratic Assignment Problem Algorithms and the Location of Indivisible FacilitiesManagement Science, 1966
- Locally Hamiltonian and planar graphsFundamenta Mathematicae, 1966
- A theory of 3-connected graphsIndagationes Mathematicae, 1961
- A Note on the Generation of Random Normal DeviatesThe Annals of Mathematical Statistics, 1958