Abstract
AbstractLet be a connected bipartite graph with vertices and edges. We give an time algorithm to decide whether is an interval bigraph. The best known algorithm has time complexity and it was developed by Muller in 1997. Our approach is based on an ordering characterization of interval bigraphs introduced by Hell and Huang in 2003. We transform the problem of finding the desired ordering to choosing strong components of a pair‐digraph without creating conflicts. We make use of the structure of the pair‐digraph as well as decomposition of bigraph based on the special components of the pair‐digraph. This way we make explicit what the difficult cases are and gain efficiency by isolating such situations.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
