2503 search results - page 148 / 501 » A study of 3-arc graphs |
190
click to vote
DAM
2011
15 years 1 months ago
2011
In this paper, we study the Minimum Sum Set Coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersectio...
181
click to vote
JCT
2011
15 years 1 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...
193
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
277
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
As peer-to-peer (P2P) networks become more familiar to the database community, intense interest has built up in using their scalability and resilience properties to scale database...
150
click to vote
INFOCOM
2008
IEEE
16 years 28 days ago
2008
IEEE
—It is important in communication networks to use routes that are as short as possible (i.e have low stretch) while keeping routing tables small. Recent advances in compact routi...