1756 search results - page 10 / 352 » Directed scale-free graphs |
116
Voted
IPL
2002
15 years 2 days ago
2002
Inspired by recent algorithms for electing a leader in a distributed system, we study the following game in a directed graph: each vertex selects one of its outgoing arcs (if any)...
99
Voted
JCT
2011
14 years 7 months ago
2011
Abstract. We generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G and its directed line graph LG. The sandpile group is an abelian group associa...
111
Voted
JGT
2010
14 years 11 months ago
2010
An antimagic labeling of an undirected graph G with n vertices and m edges is a bijection from the set of edges of G to the integers {1, . . . , m} such that all n vertex sums are...
CORR
2008
Springer
15 years 15 days ago
2008
Springer
An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighborhood of the third vertex. Asteroidal triples play a central ...
103
click to vote
STACS
2010
Springer
15 years 7 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...