Results 1  10
of
701,272
Bisection of Random Cubic Graphs
, 2000
"... In this paper we present two randomized algorithms to compute the bisection width of random cubic graphs with n vertices, giving an asymptotic upper bound for the bisection width respectively of 0.174039n and 0.174501n. We also obtain an asymptotic lower bound for the size of the max bisection of a ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
In this paper we present two randomized algorithms to compute the bisection width of random cubic graphs with n vertices, giving an asymptotic upper bound for the bisection width respectively of 0.174039n and 0.174501n. We also obtain an asymptotic lower bound for the size of the max bisection of a
Random Cubic Graphs Are Not Homomorphic to the Cycle Of Size 7
"... We prove that a random cubic graph almost surely is not homomorphic to a cycle of size 7. This ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
We prove that a random cubic graph almost surely is not homomorphic to a cycle of size 7. This
On the independence number of random cubic graphs
 RANDOM STRUCTURES & ALGORITHMS
, 1994
"... We show that as n! 1, the independence number (G), for almost all 3regular graphs G on n vertices, is at least (6 log(3=2) 2 )n, for any constant > 0. We prove this by analyzing a greedy algorithm for nding independent sets. ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
We show that as n! 1, the independence number (G), for almost all 3regular graphs G on n vertices, is at least (6 log(3=2) 2 )n, for any constant > 0. We prove this by analyzing a greedy algorithm for nding independent sets.
Maximum Induced Matchings of Random Cubic Graphs
 JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS
"... We present a heuristic for finding a large induced matching of cubic graphs. We analyse the performance of this heuristic, which is a random greedy algorithm, on random cubic graphs using dierential equations and obtain a lower bound on the expected size of the induced matching, M, returned by ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
We present a heuristic for finding a large induced matching of cubic graphs. We analyse the performance of this heuristic, which is a random greedy algorithm, on random cubic graphs using dierential equations and obtain a lower bound on the expected size of the induced matching, M, returned
Minimum independent dominating sets of random cubic graphs. Random Structures and Algorithms
, 2002
"... We present a heuristic for finding a small independent dominating set, D, of cubic graphs. We analyse the performance of this heuristic, which is a random greedy algorithm, on random cubic graphs using differential equations and obtain an upper bound on the expected size of D. A corresponding lower ..."
Abstract

Cited by 19 (12 self)
 Add to MetaCart
We present a heuristic for finding a small independent dominating set, D, of cubic graphs. We analyse the performance of this heuristic, which is a random greedy algorithm, on random cubic graphs using differential equations and obtain an upper bound on the expected size of D. A corresponding lower
Minimum Connected Dominating Sets of Random Cubic Graphs
, 2002
"... We present a simple heuristic for nding a small connected dominating set of cubic graphs. The averagecase performance of this heuristic, which is a randomised greedy algorithm, is analysed on random nvertex cubic graphs using dierential equations. In this way, we prove that the expected size o ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
We present a simple heuristic for nding a small connected dominating set of cubic graphs. The averagecase performance of this heuristic, which is a randomised greedy algorithm, is analysed on random nvertex cubic graphs using dierential equations. In this way, we prove that the expected size
Maximum 2Independent Sets of Random Cubic Graphs
 The Australasian Journal of Combinatorics. Toappear
"... We present a simple, yet efficient, heuristic for finding a large 2independent set of cubic graphs. We analyse the performance of this heuristic, which is a randomised greedy algorithm, on random nvertex cubic graphs using differential equations. In this way, we are able to prove that the expected ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We present a simple, yet efficient, heuristic for finding a large 2independent set of cubic graphs. We analyse the performance of this heuristic, which is a randomised greedy algorithm, on random nvertex cubic graphs using differential equations. In this way, we are able to prove
THE DOMINATING NUMBER OF A RANDOM Cubic Graph
, 2000
"... We show that if G is a random 3regular graph on n vertices, then its dominatingnumber, D(G), almost surely satisfies:2636n ^ D(G) ^:3126n. ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We show that if G is a random 3regular graph on n vertices, then its dominatingnumber, D(G), almost surely satisfies:2636n ^ D(G) ^:3126n.
Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs
, 1995
"... We consider the performance of a simple greedy matching algorithm MINGREEDY when applied to random cubic graphs. We show that if n is the expected number of vertices not matched by MINGREEDY, then there are positive constants c 1 and c 2 such that c 1 n 1=5 n c 2 n 1=5 log n. 1 Introduction ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
We consider the performance of a simple greedy matching algorithm MINGREEDY when applied to random cubic graphs. We show that if n is the expected number of vertices not matched by MINGREEDY, then there are positive constants c 1 and c 2 such that c 1 n 1=5 n c 2 n 1=5 log n. 1
Results 1  10
of
701,272