Concepedia

Computing the permanental polynomials of bipartite graphs by Pfaffian orientation

Heping Zhang, Wei Li

Discrete Applied Mathematics · 2012 · 37 citations · 13 references

DOIFull text

Open access

Concepts

References

13

The complexity of computing the permanent

Leslie G. Valiant · Theoretical Computer Science · 1979 · 2.8K citations

, , +9

A characterization of convertible (0, 1)-matrices

Charles H. C. Little · Journal of Combinatorial Theory Series B · 1975 · 133 citations

, , +6

Plane elementary bipartite graphs

Heping Zhang, Fuji Zhang · Discrete Applied Mathematics · 2000 · 128 citations · Full text

, , +7

Permanental polynomials of graphs

Russell Merris, Kenneth R. Rebman, William Watkins · Linear Algebra and its Applications · 1981 · 97 citations

, , +7

Massively parallel Vlasov simulation of electromagnetic drift-wave turbulence

F. Jenko · Computer Physics Communications · 2000 · 88 citations

, , +14