On maximal and minimal triangular planar graphs: an optimization approach

DOI10.1080/0020739930240302zbMath0794.05017OpenAlexW2011442209MaRDI QIDQ4281812

Sydney C. K. Chu

Publication date: 10 March 1994

Published in: International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0020739930240302

zbMATH Keywords

optimization problemknapsacktriangular planar graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75)

Cites Work

• Unnamed Item
• Algorithms for Scheduling Independent Tasks
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• The Theory and Computation of Knapsack Functions

This page was built for publication: On maximal and minimal triangular planar graphs: an optimization approach