#### Filter Results:

- Full text PDF available (127)

#### Publication Year

1952

2017

- This year (3)
- Last 5 years (21)
- Last 10 years (59)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

#### Method

Learn More

- Frank Dehne, Andreas Fabri, Andrew Rau-Chaplin
- Symposium on Computational Geometry
- 1993

Parallel Computational Geometry is concerned with solving some given geometric problem of size n on a parallel computer with p processors (e.g., a PRAM, mesh, or hypercube multiprocessor) in time TPa~~l/~l. We call T the parallel solution optimal, if T“aralle~ = 0( ‘e~~ntz”~), where T~e~Uential is the sequential time complexity of the problem. Theoretical… (More)

- Edson Cáceres, Frank Dehne, +5 authors Siang Wun Song
- Algorithmica
- 1997

In this paper we present deterministic parallel algorithms for the coarse-grained multicomputer (CGM) and bulk synchronous parallel (BSP) models for solving the following well-known graph problems: (1) list ranking, (2) Euler tour construction in a tree, (3) computing the connected components and spanning forest, (4) lowest common ancestor preprocessing,… (More)

- Sylvain Pitre, Frank Dehne, +9 authors Ashkan Golshani
- BMC Bioinformatics
- 2006

Identification of protein interaction networks has received considerable attention in the post-genomic era. The currently available biochemical approaches used to detect protein-protein interactions are all time and labour intensive. Consequently there is a growing need for the development of computational tools that are capable of effectively identifying… (More)

- Frank Dehne, Andreas Fabri, Andrew Rau-Chaplin
- Int. J. Comput. Geometry Appl.
- 1996

We study scalable parallel computational geometry algorithms for the coarse grained multicomputermodel: p processors solving a problem on n data items, were each processor has O( p ) O(1) local memory and all processors are connected via some arbitrary interconnection network (e.g. mesh, hypercube, fat tree). We present O(sequential p + Ts(n; p)) time… (More)

- Frank Dehne, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Kim Stevens
- Theory of Computing Systems
- 2005

We describe an algorithm for the Feedback Vertex Set problem on undirected graphs, parameterized by the size k of the feedback vertex set, that runs in time O(ckn3) where c = 10.567 and n is the number of vertices in the graph. The best previous algorithms were based on the method of bounded search trees, branching on short cycles. The best previous running… (More)

- S. Pitre, C. North, +7 authors A. Golshani
- Nucleic acids research
- 2008

Protein-protein interaction (PPI) maps provide insight into cellular biology and have received considerable attention in the post-genomic era. While large-scale experimental approaches have generated large collections of experimentally determined PPIs, technical limitations preclude certain PPIs from detection. Recently, we demonstrated that yeast PPIs can… (More)

- James Cheetham, Frank Dehne, Andrew Rau-Chaplin, Ulrike Stege, Peter J. Taillon
- J. Comput. Syst. Sci.
- 2003

Fixed-parameter tractability (FPT) techniques have recently been successful in solving NP-complete problem instances of practical importance which were too large to be solved with previous methods. In this paper, we show how to enhance this approach through the addition of parallelism, thereby allowing even larger problem instances to be solved in practice.… (More)

- Frank Dehne, Silvia Götz
- SRDS
- 1998

We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p is the number of processors. For this case, we show that simple algorithms with dataindependent communication patterns are efficient, both in theory and in practice. The… (More)

We present a randomized parallel algorithm for constructing the 3D convex hull on a generic p-processor coarse grained multicomputer with arbitrary interconnection network and n/p local memory per processor, where ~ z p’+’ (for some arbitrarily small c > O). For any given set of n points in 3-space, the algorithm computes the 3D convex hull, with high… (More)

- Glenn Hickey, Frank Dehne, Andrew Rau-Chaplin, Christian Blouin
- Evolutionary bioinformatics online
- 2008

The subtree prune and regraft distance (d(SPR)) between phylogenetic trees is important both as a general means of comparing phylogenetic tree topologies as well as a measure of lateral gene transfer (LGT). Although there has been extensive study on the computation of d(SPR) and similar metrics between rooted trees, much less is known about SPR distances… (More)