Our main contribution is to exhibit a very simple, lineartime, recognition algorithm for interval graphs involving four sweeps of the we&known Lexicographic Breadth First Search. Unlike the vast ...

In this paper we face the inexact graph matching problem from the parallel algorithms viewpoint. After a brief introduction of both graph matching and parallel computing contexts, we discuss a ...

To decide whether a given graph is the visibility graph of some simple polygon, is not known to be NP, nor is it known to be NP-hard. It is only known to be PSPACE. The problem of characterizing ...

This old project implements algorithms described in the following paper to determine whether a given graph is an interval graph: Lex-BFS and Partition Refinement, with Applications to Transitive ...