1729 search results - page 56 / 346 » Bound Graph Polysemy |
153
Voted
SODA
2010
ACM
16 years 2 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...
141
click to vote
IPPS
2002
IEEE
15 years 9 months ago
2002
IEEE
In this paper, we propose a new distributed algorithm that constructs a sparse spanner subgraph of the unit disk graph efficiently for wireless ad hoc networks. It maintains a li...
174
Voted
ISAAC
2010
Springer
15 years 2 months ago
2010
Springer
Howard's policy iteration algorithm is one of the most widely used algorithms for finding optimal policies for controlling Markov Decision Processes (MDPs). When applied to we...
117
click to vote
ARSCOM
2008
15 years 4 months ago
2008
Let P(n, k) denote the number of graphs on n + k vertices that contain Pn, a path on n vertices, as an induced subgraph. In this note we will find upper and lower bounds for P(n, ...
120
Voted
DM
2006
15 years 4 months ago
2006
For a graph G and k a real number, we consider the sum of the k-th powers of the degrees of the vertices of G. We present some general bounds on this sum for various values of k. ...