
LinearTime Recognition of DoubleThreshold Graphs
A graph G = (V,E) is a doublethreshold graph if there exist a vertexwe...
read it

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

A recognition algorithm for adjusted interval digraphs
Min orderings give a vertex ordering characterization, common to some gr...
read it

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

Fast Diameter Computation within Split Graphs
When can we compute the diameter of a graph in quasi linear time? We add...
read it

Graph classes and forbidden patterns on three vertices
This paper deals with graph classes characterization and recognition. A ...
read it

Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six
We consider the problem of counting all kvertex subgraphs in an input g...
read it
Characterization and Lineartime Recognition of Paired Threshold Graphs
In a paired threshold graph, each vertex has a weight, and two vertices are adjacent if their weight sum is large enough and their weight difference is small enough. It generalizes threshold graphs and unit interval graphs, both very well studied. We present a vertex ordering characterization of this graph class, which enables us to prove that it is a subclass of interval graphs. Further study of clique paths of paired threshold graphs leads to a simple lineartime recognition algorithm for the class.
READ FULL TEXT
Comments
There are no comments yet.