 Eades, P., Foulds, LR, and Giffin, J. (1982), "An efficient heuristic for identifying a maximum weight planar subgraph", in: Lecture Notes in Mathematics No.  Graph Theory Applications - Page 369by L.R. Foulds - 1995 - 408 pagesLimited preview - About this book
 | Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis - Computers - 2004 - 534 pages
...Lecture Notes in Computer Science, vol. 1017, 1995. [EFG82] Peter Eades, LR Foulds, and JW Giffin. An efficient heuristic for identifying a maximum weight...planar subgraph. In Combinatorial Mathematics IX, Proceedin9s 9th Australian Conference, Brisbane, Australia, 1981, pages 239-251. Springer- Verlag,... | |
| |
