期刊
RANDOM STRUCTURES & ALGORITHMS
卷 21, 期 3-4, 页码 414-430出版社
WILEY-BLACKWELL
DOI: 10.1002/rsa.10062
关键词
-
We present a few results and a larger number of questions concerning, partitions of graphs or hypergraphs, where the objective is to maximize or minimize several quantities simultaneously. We consider a variety of extremal problems; many of these also have algorithmic counterparts. (C) 2002 Wiley Periodicals, Inc.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据