Nick Holloway  Home/Search
Context
Related
| dcs.warwick.ac.uk/pub/repor...all.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: dcs.warwick.ac.uk/pub/rep...hol94 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: published in the European Association for Theoretical Computer Science Bulletin, Number 50, June 1993. ffl Presented at the Algorithms and Complexity II project workshop, held in Homburg, Germany, September 1993. ffl Presented at Workshop on Graphs '93. Published[15] in the proceedings: vi N.W. Holloway, S. Ravindran, and A.M. Gibbons. "Approximating minimumweight perfect matchings for complete graphs satisfying the triangle inequality", In Graph-Theoretic Concepts in Computer Science,... (Update)
Active bibliography (related documents): More All
0.7: On the parallel complexity of Hamiltonian Cycle and.. - Dahlhaus, Hajnal.. (1993) (Correct)
0.6: A General Approximation Technique For Constrained Forest.. - Goemans, Williamson (1992) (Correct)
0.3: Fast and Simple Algorithms for Weighted Perfect Matching - Wattenhofer, Wattenhofer (Correct)
Similar documents based on text: More All
0.1: An Infrastructure for Web-Based - Computer-Assisted Learning Mike (2002) (Correct)
0.1: Pluggable Authentication Module for Windows NT - Itoi (1998) (Correct)
0.0: Programmable Active Memories: a Performance Assessment - Bertin, Roncin, Vuillemin (1993) (Correct)
BibTeX entry: (Update)
@misc{ holloway-parallel,
author = "Nick Holloway",
title = "Parallel Algorithms in Graph Theory and Algebra",
url = "citeseer.ist.psu.edu/469579.html" }
Citations (may not include all citations):2138 Genetic Algorithms in Search (context) - Goldberg - 1989
1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
981 Introduction to Parallel Algorithms and Architectures: Array.. (context) - Leighton - 1992
276 Finite Markov chains (context) - Kemeny, Snell - 1976
268 Parallel algorithms for shared memory machines (context) - Karp, Ramachandran - 1991
151 Every planar map is four colorable (context) - Appel, Haken - 1977
151 Every planar map is four colorable (context) - Appel, Haken et al. - 1977
151 Every Planar Map is Four Colorable (context) - Appel, Haken - 1989
136 Efficient Parallel Algorithms (context) - Gibbons, Rytter - 1988
107 Algorithmic Graph Theory (context) - Gibbons - 1985
106 Matching is as easy as matrix inversion (context) - Mulmuley, Vazirani et al. - 1987
93 Modeling genetic algorithms with Markov chains (context) - Nix, Vose - 1992
45 trees and flowers (context) - Edmonds - 1965
41 Constructing a perfect matching is in random NC (context) - Karp, Upfal et al. - 1985
21 The matching problem for bipartite graphs with polynomially .. (context) - Grigoriev, Karpinski - 1987
16 Finite Markov chain models of an alternative selection strat.. - Mahfoud - 1993
12 a greedy heuristic for complete matching (context) - Reingold, Tarjan - 1984
8 Lectures on Parallel Computation (context) - Gibbons, Spirakis - 1993
8 An improved algorithm for maximal matching (context) - Israeli, Shiloach - 1986
7 Improved processor bounds for combinatorial problems in RNC (context) - Galil, Pan - 1988
6 An Analysis of the Effects of Selection in Genetic Algorithm.. (context) - Baker - 1989
6 Two processor scheduling is in NC (context) - Hembold, Mayer - 1986
4 Heuristics for weighted perfect matching (context) - Supowit, Plaisted et al. - 1980
3 Problems on pairs of trees and the four colour problem of pl.. (context) - Czumaj, Gibbons - 1993
3 Heuristic matching for graphs satisfying the triangle inequa.. (context) - Plaisted - 1984
2 Parallel construction of perfect matching and hamiltonian cy.. (context) - Dalhaus, Karpinski - 1988
1 Approximating minimum weight perfect matchings for complete .. (context) - Holloway, Ravindran et al. - 1993
1 Guide to examinations for higher degrees by research (context) - of, School - 1992
1 Efficient Parallel Graph Algorithms (context) - Ramachandran - 1993
1 The maximum perfect weight matching problem for complete wei.. (context) - Osiakwan, Akl - 1990
1 Linear time approximation algorithms for finding the minimum.. (context) - Iri, Murota et al. - 1981
1 Computing a perfect matching in a line graph (context) - Naor - 1989
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC