@misc{David_H._Muradian_A,
 author={David H. Muradian},
 howpublished={online},
 publisher={Изд-во НАН РА},
 abstract={In this paper we show that the Bandwidth Minimization problem for interval graphs can be solved in time O(n∆2log(∆)), where n is the vertex number and Δ is the maximal degree of vertex of the interval graph.},
 type={Հոդված},
 title={A Polynomial Algorithm for the Minimum Bandwidth of Interval Graphs},
 keywords={Mathematics, Science, Graph theory, Algorithm},
}