Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

We present a new efficient combinatorial algorithm for recognizing if a given symmetric matrix is Robinsonian, i.e., if its rows… Expand

Is this relevant?

2015

2015

Comparability graphs are the undirected graphs whose edges can be directed so that the resulting directed graph is transitive… Expand

Is this relevant?

2014

2014

Abstract We define an atom tree of a graph as a generalization of a clique tree: its nodes are the atoms obtained by clique… Expand

Is this relevant?

2011

2011

This thesis presents the first sub-quadratic circle graph recognition algorithm, and develops improved algorithms for two… Expand

Is this relevant?

2011

2011

A common way to decide the consistency problem of a qualitative constraint network (QCN) is to encode it as a boolean formula in… Expand

Is this relevant?

2010

2010

Graph search algorithms have exploited graph extremities, such as the leaves of a tree and the simplicial vertices of a chordal… Expand

Is this relevant?

2008

2008

Interval graphs are the intersection graphs of families of intervals in the real line. If the intervals can be chosen so that no… Expand

Is this relevant?

2001

2001

Determining the diameter of a graph is a fundamental graph operation, yet no efficient (i.e. linear or quadratic time) algorithm… Expand

Is this relevant?

2001

2001

Abstract. Although lexicographic (lex) variants of greedy algorithms are often P -complete, NC
-algorithms are… Expand

Is this relevant?

2000