Sciweavers

148 search results - page 13 / 30
» Sums of powers of the degrees of a graph
Sort
View
67
Voted
JGT
2008
61views more  JGT 2008»
14 years 11 months ago
Irregularity strength of dense graphs
Let G be a simple graph of order n with no isolated vertices and no isolated edges. For a positive integer w, an assignment f on G is a function f : E(G) {1, 2, . . . , w}. For a ...
Bill Cuckler, Felix Lazebnik
SODA
2003
ACM
130views Algorithms» more  SODA 2003»
15 years 1 months ago
Directed scale-free graphs
We introduce a model for directed scale-free graphs that grow with preferential attachment depending in a natural way on the in- and out-degrees. We show that the resulting in- an...
Béla Bollobás, Christian Borgs, Jenn...
STACS
2010
Springer
15 years 6 months ago
Large-Girth Roots of Graphs
We study the problem of recognizing graph powers and computing roots of graphs. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r + ...
Anna Adamaszek, Michal Adamaszek
WDAG
2009
Springer
147views Algorithms» more  WDAG 2009»
15 years 6 months ago
Compact Routing in Power-Law Graphs
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...
Wei Chen, Christian Sommer 0002, Shang-Hua Teng, Y...
ADHOCNOW
2004
Springer
15 years 5 months ago
Approximating the Minimum Number of Maximum Power Users in Ad Hoc Networks
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
Errol L. Lloyd, Rui Liu, S. S. Ravi