#### Filter Results:

- Full text PDF available (10)

#### Publication Year

2001

2009

- This year (0)
- Last 5 years (0)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Michael Hallett, Matthew Kitching, +7 authors David R. Wood
- 2001

A bipartite graph is biplanar if the vertices can be placed on two parallel lines (layers) in the plane such that there are no edge crossings when edges are drawn as line segments between the layers. In this paper we study the 2-Layer Planarization problem: can k edges be deleted from a given graph G so that the remaining graph is biplanar? This problem is… (More)

We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient search, but practical efforts have largely been limited to random guessing and heuristically designed weighting systems. In contrast, we derive a new version of Belief Propagation (BP)… (More)

- Matthew Kitching, Fahiem Bacchus
- IJCAI
- 2009

Branch and bound is an effective technique for solving constraint optimization problems (COP’s). However, its search space expands very rapidly as the domain sizes of the problem variables grow. In this paper, we present an algorithm that clusters the values of a variable’s domain into sets. Branch and bound can then branch on these sets of values rather… (More)

- Vida Dujmovic, Michael R. Fellows, +9 authors David R. Wood
- Algorithmica
- 2001

A bipartite graph is biplanar if the vertices can be placed on two parallel lines (layers) in the plane such that there are no edge crossings when edges are drawn as line segments between the layers. In this paper we study the 2-Layer Planarization problem: Can k edges be deleted from a given graph G so that the remaining graph is biplanar? This problem is… (More)

- Vida Dujmovic, Michael R. Fellows, +9 authors David R. Wood
- Algorithmica
- 2001

We consider graph drawings in which vertices are assigned to layers and edges are drawn as straight line-segments between vertices on adjacent layers. We prove that graphs admitting crossing-free h-layer drawings (for fixed h) have bounded pathwidth. We then use a path decomposition as the basis for a linear-time algorithm to decide if a graph has a… (More)

- M Kitching
- Journal of wound care
- 2004

OBJECTIVE
To gain an insight into patients' perceptions and experiences of larval therapy.
METHOD
A phenomenological approach was adopted in which six patients who recently had had larval therapy were interviewed using an open, unstructured approach in two hospital settings. Data analysis was loosely based on Colaizzi's structured analysis technique.
… (More)

- Matthew Kitching, Fahiem Bacchus
- IJCAI
- 2007

Caching, symmetries, and search with decomposition are powerful techniques for pruning the search space of constraint problems. In this paper we present an innovative way of efficiently combining these techniques with branch and bound for solving certain types of constraint optimization problems (COPs). Our new method significantly reduces the overhead of… (More)

- Matthew Kitching, Fahiem Bacchus
- CP
- 2008

Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP’s) the standard technique of invoking a separate recursion to solve each independent component can significantly reduce the strength of the bounds that can be applied when using branch and bound techniques.… (More)

- Matthew Kitching, Sue Whitesides
- Graph Drawing
- 2004

We consider the following graph embedding question: given a graph G, is it possible to map its vertices to points in 3D such that G is isomorphic to the mutual nearest neighbor graph of the set P of points to which the vertices are mapped? We show that this problem is NP-hard. We do this by extending the “logic engine” method to three dimensions by using… (More)

- Matthew Kitching, Fahiem Bacchus
- IJCAI
- 2009

Decomposition is an effective technique for solving discrete Constraint Optimization Problems (COPs) with low tree-width. On problems with high treewidth, however, existing decomposition algorithms offer little advantage over branch and bound search (B&B). In this paper we propose a method for exploiting decomposition on problems with high treewidth. Our… (More)