Improved sublinear time algorithm for width-bounded separators

DOI10.1007/978-3-642-14553-7_12MaRDI QIDQ3587340zbMATH OpenOpenAlexFDO

Authors Liang Ding, Bin Fu, Yunhui Fu

Publication date 7 September 2010

Published in Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14553-7_12

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20) Analysis of algorithms (68W40)

Recommendations

• Sublinear time width-bounded separators and their application to the protein side-chain packing problem
• Sublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem
• Theory and application of width bounded geometric separators
• SEPARATING SETS OF HYPERRECTANGLES
• Algorithms for weak and wide separation of sets

Cited in

(4)

• Finding small separators in linear time via treewidth reduction
• Theory and application of width bounded geometric separators
• Algorithms for weak and wide separation of sets
• Sublinear time width-bounded separators and their application to the protein side-chain packing problem

This page was built for publication: Improved sublinear time algorithm for width-bounded separators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3587340)