Jump to content

Edmonds matrix

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Wangyusha (talk | contribs) at 09:18, 5 October 2015 (x). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In graph theory, the Edmon

The Edmonds matrix is named after Jack Edmonds. The Tutte matrix is a generalisation to non-bipartite graphs.

References

  • R. Motwani, P. Raghavan (1995). Randomized Algorithms. Cambridge University Press. p. 167.
  • Allen B. Tucker (2004). Computer Science Handbook. CRC Press. p. 12.19. ISBN 1-58488-360-X.
Stub icon

This combinatorics-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Edmonds_matrix&oldid=684218337"