1629 search results - page 30 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
ALGORITHMICA
2008
14 years 10 months ago
2008
We show efficient algorithms for edge-coloring planar graphs. Our main result is a linear-time algorithm for coloring planar graphs with maximum degree with max{, 9} colors. Thus...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
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...
ICC
2007
IEEE
15 years 1 months ago
2007
IEEE
Motivated by combinatorial optimization theory, we propose an algorithmic power allocation method that minimizes the total transmitting power in transmitter diversity systems, prov...
WWW
2004
ACM
15 years 10 months ago
2004
ACM
The web graph follows the power law distribution and has a hierarchy structure. But neither the PageRank algorithm nor any of its improvements leverage these attributes. In this p...
ICDM
2009
IEEE
14 years 7 months ago
2009
IEEE
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining ...