Olariu S.

S. Olariu

Information about the author S. Olariu will soon be added to the site.
Found 5 papers in total
Interval graph problems on reconfigurable meshes
Interval graph problems on reconfigurable meshes
1995
A graph G is an interval graph if there is a one–one correspondence between its...
An optimal path cover algorithm for cographs
An optimal path cover algorithm for cographs
1995
The class of cographs, or complement-reducible graphs, arises naturally in many...
On a unique tree representation for P4-extendible graphs
On a unique tree representation for P4-extendible graphs
1991
Several practical applications in computer science and computational linguistics...
A tree representation for P4-sparse graphs
A tree representation for P4-sparse graphs
1992
A graph G is P 4 -sparse if no set of five vertices in G induces more than one...
Some aspects of the semi-perfect elimination
Some aspects of the semi-perfect elimination
1991
Several efficient algorithms have been proposed to construct a perfect elimination...
Papers per page: