Beverly Jamison

According to our database, Beverly Jamison authored at least 10 papers between 1989 and 1995.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1995

A Linear-Time Recognition Algorithm for P4-Reducible Graphs.

Beverly Jamison, Stephan Olariu

Theor. Comput. Sci., 1995

P-Components and the Homogeneous Decomposition of Graphs.

Beverly Jamison, Stephan Olariu

SIAM J. Discret. Math., 1995

Linear Time optimization Algorithms for P4-sparse Graphs.

Beverly Jamison, Stephan Olariu

Discret. Appl. Math., 1995

1992

Recognizing P_4 Sparse Graphs in Linear Time.

Beverly Jamison, Stephan Olariu

SIAM J. Comput., 1992

A tree representation for P₄-sparse graphs.

Beverly Jamison, Stephan Olariu

Discret. Appl. Math., 1992

Indexing for Multi-Attribute Retrieval (Short Note).

Beverly Jamison, Stephan Olariu

Comput. J., 1992

On the Homogeneous Decomposition of Graphs.

Beverly Jamison, Stephan Olariu

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1992

1991

On a unique tree representation for P₄-extendible graphs.

Beverly Jamison, Stephan Olariu

Discret. Appl. Math., 1991

1989

The Role of Linkage-Graphs in Prolog Relational Datenbases.

Hussein M. Abdel-Wahab, Beverly Jamison

SIGMOD Rec., 1989

A Linear-Time Recognition Algorithm for P₄-Reducible Graphs.

Beverly Jamison, Stephan Olariu

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1989