The k-MAXCUT problem for undirected graphs C = (V, E ) consists of finding a partition V = V , U . . . U V, such that the number of edges with endpoints in two different sets V, is maximized. We offer a new approach to this problem by showing that the combinatorial notion of block designs can be use
β¦ LIBER β¦
Combinatorial Approaches to Design Complex Metal Oxides
β Scribed by Ferdi Schueth; Stephan A. Schunk
- Publisher
- John Wiley and Sons
- Year
- 2006
- Weight
- 8 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0931-7597
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A combinatorial design approach to MAXCU
β
Thomas Hofmeister; Hanno Lefmann
π
Article
π
1996
π
John Wiley and Sons
π
English
β 710 KB
ChemInform Abstract: Ring-Opening Reacti
β
Yves Rubin
π
Article
π
2010
π
John Wiley and Sons
β 24 KB
π 2 views
ChemInform Abstract: A Scalable Approach
β
Puneet Sharma; Srinivasa Salapaka; Carolyn Beck
π
Article
π
2008
π
John Wiley and Sons
β 15 KB
π 2 views
A thermodynamic-combinatorial approach t
β
John R. Flower; Bodo Linnhoff
π
Article
π
1980
π
American Institute of Chemical Engineers
π
English
β 949 KB
General molecular mechanics approach to
β
Gajewski, Joseph J.; Gilbert, Kevin E.; Kreek, Thomas W.
π
Article
π
1998
π
John Wiley and Sons
π
English
β 156 KB
Transition metal complexes have been treated by a molecular mechanics approach using an MM2-like valence force field for the ligands and a UreyαBradley force field about the metal. Metalαligand atom bonds are parameterized with dependence on the metal covalent radius. The current metalαligand distan
Combinatorial Chemistry Approach to Chir
β
Kuiling Ding; Haifeng Du; Yu Yuan; Jiang Long
π
Article
π
2004
π
John Wiley and Sons
π
English
β 416 KB
π 1 views