搜索结果: 1-3 共查到“应用数学 Packing”相关记录3条 . 查询时间(0.062 秒)
Tuza conjectured that for every graph G, the maximum size of a set of edge-disjoint triangles and minimum size of a set of edges meeting all triangles, satisfy 2.
A Minimum Energy Condition of 1-Dimensional Periodic Sphere Packing
Packing Energy One-dimension
2008/7/3
A Minimum Energy Condition of 1-Dimensional Periodic Sphere Packing.
We give an “excluded minor” and a “structural” characterization of digraphs D that have the property that for every subdigraph H of D, the maximum number of disjoint circuits in H is equal to the mini...