论文信息 - MATHEMATICAL ENGINEERING TECHNICAL REPORTS Solving Linear Programs from Sign Patterns - 字舞流文

MATHEMATICAL ENGINEERING TECHNICAL REPORTS Solving Linear Programs from Sign Patterns

Satoru Iwata | Naonori Kakimura

[1] Bryan L. Shader,et al. On matrices which have signed null-spaces , 2002 .

[2] Bryan L. Shader,et al. Linear systems with signed solutions , 2000 .

[3] Richard A. Brualdi,et al. Matrices of Sign-Solvable Linear Systems , 1995 .

[4] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[5] Bryan L. Shader,et al. Sign-consistency and solvability of constrained linear systems , 1998 .

[6] Jia-Yu Shao,et al. Some properties of matrices with signed null spaces , 2004, Discret. Math..

[7] Richard A. Brualdi,et al. Sign-central matrices , 1994 .

[8] William McCuaig,et al. Pólya's Permanent Problem , 2004, Electron. J. Comb..

[9] Paul D. Seymour,et al. Characterization of even directed graphs , 1987, J. Comb. Theory, Ser. B.

[10] Robert E. Tarjan,et al. Faster Scaling Algorithms for Network Problems , 1989, SIAM J. Comput..

[11] Robin Thomas,et al. PERMANENTS, PFAFFIAN ORIENTATIONS, AND EVEN DIRECTED CIRCUITS , 1997, STOC 1997.

[12] Mihalis Yannakakis,et al. Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs , 1989, Discret. Appl. Math..