1736 search results - page 3 / 348 » The rank-width of Directed Graphs |
84
Voted
JGT
2011
14 years 7 months ago
2011
116
Voted
IPL
2002
15 years 3 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...
158
Voted
EDBT
2011
ACM
14 years 4 months ago
2011
ACM
Graph clustering has generally concerned itself with clustering undirected graphs; however the graphs from a number of important domains are essentially directed, e.g. networks of...