New Upper Bounds on Continuous Tree Edge-Partition Problem

2008 ◽  
pp. 38-49
Author(s):  
Robert Benkoczi ◽  
Binay Bhattacharya ◽  
Qiaosheng Shi
Keyword(s):  
Upper Bounds ◽  
Partition Problem ◽  
Tree Edge ◽  
Edge Partition

CONFIGURATIONAL ENTROPY IN OCTAGONAL TILING MODELS

1993 ◽  
Vol 07 (06n07) ◽  
pp. 1427-1436 ◽  
Author(s):  
RÉMY MOSSERI ◽  
FRANCIS BAILLY
Keyword(s):  
Configurational Entropy ◽  
Upper Bounds ◽  
Partition Problem ◽  
Asymptotic Case ◽  
Random Tilings

We calculate the configurational entropy of random tilings obtained by elementary flips from a perfect octagonal tiling with an octagonal boundary. We map the problem of generating all configurations onto a partition problem. We calculate numerically the number of configurations and the associated entropy. We give some exact expressions in restricted cases and upper bounds for the entropy in the asymptotic case.

The SONET edge-partition problem

Networks ◽  
2002 ◽  
Vol 41 (1) ◽  
pp. 13-23 ◽  
Author(s):  
Olivier Goldschmidt ◽  
Dorit S. Hochbaum ◽  
Asaf Levin ◽  
Eli V. Olinick
Keyword(s):  
Partition Problem ◽  
Edge Partition

scholarly journals Cutting plane algorithms for solving a stochastic edge-partition problem

2009 ◽  
Vol 6 (4) ◽  
pp. 420-435 ◽  
Author(s):  
Z. Caner Taşkın ◽  
J. Cole Smith ◽  
Shabbir Ahmed ◽  
Andrew J. Schaefer
Keyword(s):  
Cutting Plane ◽  
Partition Problem ◽  
Cutting Plane Algorithms ◽  
Edge Partition

scholarly journals Inapproximability of the Minimum Biclique Edge Partition Problem

2010 ◽  
Vol E93-D (2) ◽  
pp. 290-292
Author(s):  
Hideaki OTSUKI ◽  
Tomio HIRATA
Keyword(s):  
Partition Problem ◽  
Edge Partition

scholarly journals Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches

2010 ◽  
Vol 158 (8) ◽  
pp. 932-942 ◽  
Author(s):  
Jyh-Jye Lin ◽  
Chi-Yuan Chan ◽  
Biing-Feng Wang
Keyword(s):  
Tree Edge ◽  
Edge Partition

Extension of the Spatial PDI Model to Three Dimensions

1997 ◽  
Vol 84 (1) ◽  
pp. 176-178
Author(s):  
Frank O'Brien
Keyword(s):  
Population Density ◽  
Dimensional Space ◽  
Finite Lattice ◽  
Three Dimensional ◽  
Upper Bounds ◽  
Three Dimensions ◽  
Lower And Upper Bounds ◽  
Density Index ◽  
Three Dimensional Space

The author's population density index ( PDI) model is extended to three-dimensional distributions. A derived formula is presented that allows for the calculation of the lower and upper bounds of density in three-dimensional space for any finite lattice.

The d-Subtree Partition Problem

2010 ◽  
Vol 33 (4) ◽  
pp. 652-665
Author(s):  
Yan-Guang CAI ◽  
Yun ZHANG ◽  
Ji-Xin QIAN
Keyword(s):  
Partition Problem

Energy of spherical fuzzy graphs

2020 ◽  
pp. 321-332
Author(s):  
S. Yahya Mohamed ◽  
A. Mohamed Ali
Keyword(s):  
Adjacency Matrix ◽  
Upper Bounds ◽  
Fuzzy Graph ◽  
Lower And Upper Bounds ◽  
Fuzzy Graphs

In this paper, the notion of energy extended to spherical fuzzy graph. The adjacency matrix of a spherical fuzzy graph is defined and we compute the energy of a spherical fuzzy graph as the sum of absolute values of eigenvalues of the adjacency matrix of the spherical fuzzy graph. Also, the lower and upper bounds for the energy of spherical fuzzy graphs are obtained.

Sign in / Sign up

Export Citation Format

Share Document