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.

2015

2015

We consider in this paper a networked system of opinion dynamics in continuous time, where the agents are able to evaluate their… Expand

Is this relevant?

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

Is this relevant?

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

Is this relevant?

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

Is this relevant?

2007

2007

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

Is this relevant?

2003

2003

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

Is this relevant?

2001

2001

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

Is this relevant?

2001

2001

We present a deterministic distributed Propagation of Information with Feedback (PIF) protocol in arbitrary rooted networks. The… Expand

Is this relevant?

1993

1993

We examine some properties of the 2-variable greedoid polynomial f(G·,t,z) when G is the branching greedoid associated to a… Expand

Is this relevant?

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

Is this relevant?