Investigations on the bisection problem

MaRDI QIDQ2922731zbMATH OpenFDO

Authors Mihai Talmaciu

Publication date 14 October 2014

Published in Scientific Studies and Research. Series Mathematics and Informatics (Search for Journal in Brave)

zbMATH Keywords

bisection problemrecognition algorithmthreshold graphsweakly decomposition

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Bipartite bithreshold graphs
• On canonical decomposition of bipartite graphs
• Bithreshold Graphs
• On the graph bisection problem
• An \(O(n^ 3)\) recognition algorithm for bithreshold graphs

Cited in

(5)

• Complexity of the bisection method
• Optimization problems on threshold graphs
• Bithreshold Graphs
• An \(O(n^ 3)\) recognition algorithm for bithreshold graphs
• Bipartite bithreshold graphs

This page was built for publication: Investigations on the bisection problem

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