Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

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

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

2012

2012

For finite q, we classify the countable, descendant-homogeneous digraphs in which the descendant set of any vertex is a q-valent… Expand

2011

2011

We pursue the problem of counting the imbeddings of a graph in each of the orientable surfaces. We demonstrate how to achieve… Expand

2008

2008

For a rooted graph $G$, let $EV(G;p)$ be the expected number of vertices reachable from the root when each edge has an… Expand

Highly Cited

2008

Highly Cited

2008

This paper presents new graph-theoretic results appropriate for the analysis of a variety of consensus problems cast in… Expand

2007

2007

This thesis investigates a pragmatic approach to typing, static analysis and static optimization of Web query languages, in… Expand

2003

2003

When G is a rooted graph where each edge may independently succeed with probability p, we consider the expected number of… Expand

2001

2001

Abstract We consider the one-variable characteristic polynomial p ( G ; λ ) in two settings. When G is a rooted digraph, we show… Expand

Highly Cited

2001

Highly Cited

2001

The basic querying mechanism over semistructured data, namely regular path queries, asks for all pairs of objects that are… Expand

Highly Cited

2000

Highly Cited

2000

Suppose that $G_j$ is a sequence of finite connected planar graphs, and in each $G_j$ a special vertex, called the root, is… Expand

Highly Cited

1978

Highly Cited

1978

A new graph product i s introduced, and t h e c h a r a c t e r i s t i c polynomial of a graph so-formed i s given a s a… Expand