𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithms for graph partitioning on the planted partition model

✍ Scribed by Anne Condon; Richard M. Karp

Publisher
John Wiley and Sons
Year
2001
Tongue
English
Weight
192 KB
Volume
18
Category
Article
ISSN
1042-9832

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A note on the bottleneck graph partition
A note on the bottleneck graph partition problem
✍ Klinz, Bettina; Woeginger, Gerhard J. πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 47 KB πŸ‘ 2 views

The bottleneck graph partition problem consists of partitioning the vertices of an undirected edge-weighted graph into two equally sized sets such that the maximum edge weight in the cut separating the two sets becomes minimum. In this short note, we present an optimum algorithm for this problem wit

Complete one- and two-center partitionin
Complete one- and two-center partitioning scheme for the total energy in the Hartree–Fock theory
✍ Hiroshi Ichikawa; Atsushi Yoshida πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 252 KB

We proposed a complete calculation scheme for attributing the total Ž . energy by the Hartree᎐Fock theory to atoms E and the region between two atoms A Ž . E . It was pointed out that the conventional method using the Fock matrix includes a A B large amount of mutual contamination in both E and E .

A Model-based Dependence of the Human Ti
A Model-based Dependence of the Human Tissue/Blood Partition Coefficients of Chemicals on Lipophilicity and Tissue Composition
✍ BalΓ‘ΕΎ, Ε tefan ;LukÑčovΓ‘, Viera πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 168 KB

Partitioning of up to thirty-six nonionizable chemicals between seven tissues (fat, liver, brain, kidney, muscle, lung, heart) and blood in humans was modeled using membrane accumulation, protein binding, and distribution in the aqueous phases as relevant processes. The extent of membrane accumulati

Algorithm for finding one of the largest
Algorithm for finding one of the largest common subgraphs of two three-dimensional graph structures
✍ Sumio Masuda; Hiroyuki Yoshioka; Eiichi Tanaka πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 176 KB πŸ‘ 1 views

Given two connected graphs G a = (V a , E a ) and G b = (V b , E b ) with three-dimensional structures. Let n a = |V a |, m a = |E a |, n b = |V b |, and m b = |E b |. Let the maxi- mum order of a vertex in G a (G b ) be l a (l b ). Initially this paper offers a method to find a largest common subgr