Search Results - "Wormald, N C"

Maximum induced matchings of random cubic graphs by Duckworth, W., Wormald, N.C., Zito, M.

“…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,…”
Get full text

Bounds on the max and min bisection of random cubic and random 4-regular graphs by Dı́az, J., Do, N., Serna, M.J., Wormald, N.C.

“…In this paper, we present a randomized algorithm to compute the bisection width of cubic and 4-regular graphs. The analysis of the proposed algorithms on…”
Get full text

Distribution of subgraphs of random regular graphs by Gao, Zhicheng, Wormald, N.C.

“…We obtain the asymptotic distribution of the number of copies of a fixed subgraph H in a random d‐regular graph, provided H is strictly balanced and d = d(n)…”
Get full text

Bounds on the bisection width for random d -regular graphs by Díaz, J., Serna, M.J., Wormald, N.C.

“…In this paper we provide an explicit way to compute asymptotically almost sure upper bounds on the bisection width of random d -regular graphs, for any value…”
Get full text

Gradient-constrained minimum networks. I. Fundamentals by Brazil, M, Rubinstein, J H, Thomas, D A, Weng, J F, Wormald, N C

“…In three-dimensional space an embedded network is called gradient-constrained if the absolute gradient of any differentiable point on the edges in the network…”
Get full text

A polynomial algorithm for a constrained traveling salesman problem by Rubinstein, J.H., Thomas, D.A., Wormald, N.C.

“…We give a polynomial‐time algorithm for finding a solution to the Traveling Salesman Problem when the points given are constrained to lie on a fixed set of…”
Get full text

Minimum independent dominating sets of random cubic graphs by Duckworth, W., Wormald, N. C.

“…We present a heuristic for finding a small independent dominating set 𝒟 of cubic graphs. We analyze the performance of this heuristic, which is a random…”
Get full text

Random Trees in Random Graphs by BENDER, E. A, WORMALD, N. C

“…We show that a random labeled $n$-vertex graph almost surely contains isomorphic copies of almost all labeled $n$-vertex trees, in two senses. In the first…”
Get full text

Linear Arboricity and Linear k-Arboricity of Regular Graphs by Alon, Noga, Teague, V. J., Wormald, N. C.

Get full text

Isomorphic Factorization of Regular Graphs and 3-Regular Multigraphs by Ellingham, M. N., Wormald, N. C.

“…A multigraph G is divisible by t if its edge set can be partitioned into t subsets, such that the subgraphs (called factors) induced by the subsets are all…”
Get full text

Random Graph Processes with Maximum Degree 2 by Ruciński, A., Wormald, N. C.

“…Suppose that a process begins with n isolated vertices, to which edges are added randomly one by one so that the maximum degree of the induced graph is always…”
Get full text

Connectedness of graphs generated by a random d-process by Ruciński, A., Wormald, N. C.

“…Suppose that a graph process begins with n isolated vertices, to which edges are added randomly one by one so that the maximum degree of the induced graph is…”
Get full text

Hamilton cycles containing randomly selected edges in random regular graphs by Robinson, R.W., Wormald, N.C.

“…In previous papers the authors showed that almost all d‐regular graphs for d≤3 are hamiltonian. In the present paper this result is generalized so that a set…”
Get full text

Asymptotic enumeration by degree sequence of graphs with degrees o(n1/2) by MCKAY, B. D, WORMALD, N. C

Get full text

Extremal clique coverings of complementary graphs by DE CAEN, D, ERDOÊS, P, PULLMANN, N. J, WORMALD, N. C

Get full text

Almost All Maps Are Asymmetric by Richmond, L.B., Wormald, N.C.

“…We give a simple proof of the fact that for a wide variety of classes of maps on surfaces, almost all maps in the class are asymmetric. Our method is based on…”
Get full text

The difficulty of constructing a leaf-labelled tree including or avoiding given subtrees by Ng, Meei Pyng, Steel, Mike, Wormald, Nicholas C

“…Given a set of trees with leaves labelled from a set L, is there a tree T with leaves labelled by L such that each of the given trees is homeomorphic to a…”
Get full text

1-Factorizations of random regular graphs by Molloy, M. S. O., Robalewska, H., Robinson, R. W., Wormald, N. C.

“…It is shown that for each r ≥ 3, a random r‐regular graph on 2n vertices is equivalent in a certain sense to a set of r randomly chosen disjoint perfect…”
Get full text

A family of perfect hashing methods by MAJEWSKI, B. S, WORMALD, N. C, HAVAS, G, CZECH, Z. J

“…Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient…”
Get full text

A tree-based Mergesort by MOFFAT, A, PETERSSON, O, WORMALD, N. C

Get full text