Article ID Journal Published Year Pages File Type
9651025 Information Sciences 2005 18 Pages PDF
Abstract
We also give a new upper bound for the thickness of complete tripartite graphs, whose vertex sets are of equal size.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Artificial Intelligence
Preview
A simulated annealing algorithm for determining the thickness of a graph
Authors
,