Sciweavers

148 search results - page 14 / 30
» Sums of powers of the degrees of a graph
Sort
View
SODA
2010
ACM
248views Algorithms» more  SODA 2010»
15 years 9 months ago
Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
Petr Hlineny, Markus Chimani
DM
2010
115views more  DM 2010»
14 years 11 months ago
Edge colouring by total labellings
We introduce the concept of an edge-colouring total k-labelling. This is a labelling of the vertices and the edges of a graph G with labels 1, 2, . . . , k such that the weights o...
Stephan Brandt, Kristína Budajová, D...
DAM
2006
47views more  DAM 2006»
14 years 11 months ago
Trees of extremal connectivity index
The connectivity index w(G) of a graph G is the sum of the weights (d(u)d(v)) of all edges uv of G, where is a real number ( = 0), and d(u) denotes the degree of the vertex u. Le...
Huiqing Liu, Mei Lu, Feng Tian
INFOCOM
2002
IEEE
15 years 4 months ago
On Distinguishing between Internet Power Law Topology Generators
— Recent work has shown that the node degree in the WWW induced graph and the AS-level Internet topology exhibit power laws. Since then several algorithms have been proposed to g...
Tian Bu, Donald F. Towsley
IJDMBC
2010
115views more  IJDMBC 2010»
14 years 6 months ago
Near Optimum Power Control and Precoding under Fairness Constraints in Network MIMO Systems
Abstract--We consider the problem of setting the uplink signalto-noise-and-interference (SINR) target and allocating transmit powers for mobile stations in multicell spatial multip...
Gábor Fodor, Mikael Johansson, Pablo Soldat...