
IntervalLike Graphs and Digraphs
We unify several seemingly different graph and digraph classes under one...
read it

Characterization and Lineartime Recognition of Paired Threshold Graphs
In a paired threshold graph, each vertex has a weight, and two vertices ...
read it

A recognition algorithm for simpletriangle graphs
A simpletriangle graph is the intersection graph of triangles that are ...
read it

Linearsemiorders and their incomparability graphs
A linearinterval order is the intersection of a linear order and an int...
read it

On Computing MinDegree Elimination Orderings
We study faster algorithms for producing the minimum degree ordering use...
read it

A Note on Maximum Integer Flows in Directed Planar Graphs with Vertex Capacities
The most efficient algorithm currently known for computing maximum integ...
read it

Graph classes and forbidden patterns on three vertices
This paper deals with graph classes characterization and recognition. A ...
read it
A recognition algorithm for adjusted interval digraphs
Min orderings give a vertex ordering characterization, common to some graphs and digraphs such as interval graphs, complements of threshold tolerance graphs (known as coTT graphs), and twodirectional orthogonal ray graphs. An adjusted interval digraph is a reflexive digraph that has a min ordering. Adjusted interval digraph can be recognized in O(n^4) 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(n^3). The algorithm produces a min ordering if the given graph is an adjusted interval digraph.
READ FULL TEXT
Comments
There are no comments yet.