Permanents, Pfaffian orientations, and even directed circuits (extended abstract)

Authors:
William McCuaig;Neil Robertson;P. D. Seymour;Robin Thomas
Affiliations:
5268 Eglinton St., Burnaby, B.C., Canada V5G 2B2;Department of Mathematics, Ohio State University, 231 W. N3th Ave., Columbus, Ohio;Bellcore, 445 South St., Morristown, New Jersey;School of Mathematics, Georgia Institute of Technology, Atlanta, Georgia
Venue:
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Year:
1997

Citing 3
Cited 9

Characterization of even directed graphs

Journal of Combinatorial Theory Series B
Pfaffian orientations 0-1 permanents, and even cycles in directed graphs

Discrete Applied Mathematics - Combinatorics and complexity
The even cycle problem for planar digraphs

Journal of Algorithms

Finding 3-shredders efficiently

ACM Transactions on Algorithms (TALG)
On the complexity of sign-nonsingularity and equal unions of sets

ACM-SE 38 Proceedings of the 38th annual on Southeast regional conference
Enumeration of perfect matchings of a type of Cartesian products of graphs

Discrete Applied Mathematics
Generating bricks

Journal of Combinatorial Theory Series B
A quadratic identity for the number of perfect matchings of plane graphs

Theoretical Computer Science
2-extendability of toroidal polyhexes and Klein-bottle polyhexes

Discrete Applied Mathematics
Enumeration of perfect matchings of a type of Cartesian products of graphs

Discrete Applied Mathematics
A combinatorial algorithm for Pfaffians

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
The Pfaffian property of Cartesian products of graphs

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract