A recognition algorithm for adjusted interval digraphs

From MaRDI portal
Publication:2656971




Abstract: Min orderings give a vertex ordering characterization, common to some graphs and digraphs such as interval graphs, complements of threshold tolerance graphs (known as co-TT graphs), and two-directional orthogonal ray graphs. An adjusted interval digraph is a reflexive digraph that has a min ordering. Adjusted interval digraph can be recognized in O(n4) time, where n is the number of vertices of the given graph. Finding a more efficient algorithm is posed as an open question. This note provides a new recognition algorithm with running time O(n3). The algorithm produces a min ordering if the given graph is an adjusted interval digraph.









This page was built for publication: A recognition algorithm for adjusted interval digraphs

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