6598 search results - page 46 / 1320 » Graph Theory with Applications |
133
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
129
click to vote
JCT
2007
15 years 3 months ago
2007
Abstract. Let n and k be natural numbers and let S(n, k) denote the Stirling numbers of the second kind. It is a conjecture of Wilf that the alternating sum nX j=0 (−1)j S(n, j) ...
122
click to vote
WG
2005
Springer
15 years 9 months ago
2005
Springer
We improve the current complexities for maintaining a chordal graph by starting with an empty graph and repeatedly adding or deleting edges.
137
click to vote
JCT
2007
15 years 3 months ago
2007
An edge in a drawing of a graph is called even if it intersects every other edge of the graph an even number of times. Pach and T´oth proved that a graph can always be redrawn so...
145
click to vote
IEEECIT
2010
IEEE
15 years 2 months ago
2010
IEEE
With the increasing popularity of COTS (commercial off the shelf) components and multi-core processor in space and aviation applications, software fault tolerance becomes attracti...