可均匀k-着色 1. A graph is equitably k-colorable if its vertices can be partitioned into k-independent sets of as near equal sizes as possible. 称图G是可均匀k-着色的,如果可以用k种颜色给G的顶点着色,使得相邻的顶点不同色且各色类的基数至多差1。
网络著色 网络释义 1. 著色 ...颜色数小於或等於 k, 则称图形 G 是可 k-著色(k-colorable)。 www.docin.com|基于 1 个网页
1.A graph is equitably k-colorable if its vertices can be partitioned into k-independent sets of as near equal sizes as possible.称图G是可均匀k-着色的,如果可以用k种颜色给G的顶点着色,使得相邻的顶点不同色且各色类的基数至多差1。 英文短句/例句 1.A sufficient and necessary condition for equi...
1. A graph is equitably k-colorable if its vertices can be partitioned into k-independent sets of as near equal sizes as possible. 称图G是可均匀k-着色的,如果可以用k种颜色给G的顶点着色,使得相邻的顶点不同色且各色类的基数至多差1。
The maximum k-colorable subgraph problem (k-MCSP) is to color as many vertices as possible with at most k colors, such that no two adjacent vertices share the same color. We consider online algorithms for this NP-hard problem, and give bounds on their competitive ratio. We then consider ...
k-edge colorable graph 英文k-edge colorable graph 中文【计】 k边可着色图
Why almost all kcolorable graphs are easy Weizmann为什么几乎所有构成的图是容易魏茨曼 It’s all about the support: a new perspective on the satisfiability problem Danny Vilenchik SAT – Basic Notions 3CNF form: F = (x1?x2??x5) ? (x3??x4??x1) ? (x1?x2?x6) ?… ? F = ( F ?F...
Library for computing Gröbner Basis in .NET using Buchberger´s algorithm. Includes sample application that checks if a given graph is k-colorable using the API. Developed for my bachelor´s project (see http://oa.upm.es/63155/ )....
k-edge colorable graph 【计】 k边可着色图相关短语 addition of K ratings K 值[系数]的加算 k. k. 【医】 膝反射 k and k machine 转子型高落式浮选机 k distinct grammar k 次相异文法 K homogeneous grammar K 次齐次文法 K meson 重介子 k ration phr. K 种口粮; 美军和盟军在第二次世界大...
分享到: 【计】 k边可着色图 分类: 通用词汇|查看相关文献(pubmed)|免费全文文献 详细解释: 以下为句子列表: 分享到: