#### Filter Results:

#### Publication Year

1999

2004

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

The Pfaffian of an oriented graph is closely linked to Perfect Matching. It is also naturally related to the determinant of an appropriately defined matrix. This relation between Pfaffian and determinant is usually exploited to give a fast algorithm for computing Pfaffians. We present the first completely combinatorial algorithm for computing the Pfaffian… (More)

The Pfaaan of a graph is closely linked to Perfect Matching. It is also naturally related to the determinant of an appropriately deened matrix. This relation between Pfaaan and determinant is usually exploited to give a fast algorithm for computing Pfaaans. We present the rst completely combinatorial algorithm for computing the Pfaaan in polynomial time. In… (More)

- ‹
- 1
- ›