Keyword: Geometric Separator : Search

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Advanced Search

SEARCH GUIDE

Results: 1 - 1of1

Follow results:

per page:

Sort: Relevance

Context for search term 1Search term 1*

All Dates

LastSelect static range

Custom Range

Select starting monthSelect starting year

Select ending monthSelect ending year

Search name	Searched On	Run search
Keyword: Derived Equivalence (10)	31 Mar 2025	Run
Keyword: Hybrid Nanomaterial (7)	31 Mar 2025	Run
Keyword: Protein Engineering (8)	31 Mar 2025	Run
Keyword: Linguistic Geometry (1)	31 Mar 2025	Run
Keyword: Geometric Separator (1)	31 Mar 2025	Run

articleNo Access
MULTI-DIRECTIONAL WIDTH-BOUNDED GEOMETRIC SEPARATOR AND PROTEIN FOLDING
- BIN FU,
- SORINEL A. OPRISAN, and
- LIZHE XU
International Journal of Computational Geometry & Applications01 Oct 2008
Preview Abstract
We introduce the concept of multi-directional width-bounded geometric separators and obtain an improved separator for grid graphs. This yields an improved exact algorithm for the protein folding problem in the HP-model. For a grid graph G with n grid points P, there exists a separator A ⊆ P such that A has at most points, and G − A has two disconnected subgraphs each with at most nodes. This improves the previous upper bound of . We also derive a lower bound for such a separator in grid graphs.

1