MULTI-DIRECTIONAL WIDTH-BOUNDED GEOMETRIC SEPARATOR AND PROTEIN FOLDING

DOI10.1142/S0218195908002696zbMath1167.65340OpenAlexW2099368064MaRDI QIDQ3607489

Bin Fu, Lizhe Xu, Sorinel Adrian Oprisan

Publication date: 2 March 2009

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195908002696

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (3)

Knowledge Discovery in Graphs Through Vertex Separation ⋮ The MIN-cut and vertex separator problem ⋮ Balanced line separators of unit disk graphs

Cites Work

• Unnamed Item
• A framework for solving VLSI graph layout problems
• An application of the planar separator theorem to counting problems
• Reduced constants for simple cycle graph separation
• A separator theorem for graphs of bounded genus
• A Separator Theorem for Planar Graphs
• Applications of a Planar Separator Theorem
• On the Problem of Partitioning Planar Graphs
• Planar Separators

This page was built for publication: MULTI-DIRECTIONAL WIDTH-BOUNDED GEOMETRIC SEPARATOR AND PROTEIN FOLDING