Computing the inertia from sign patterns
From MaRDI portal
Publication:877192
DOI10.1007/S10107-006-0056-6zbMATH Open1149.65025OpenAlexW2112731657MaRDI QIDQ877192FDOQ877192
Naonori Kakimura, Satoru Iwata
Publication date: 19 April 2007
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-006-0056-6
Recommendations
Cites Work
- Matrix Analysis
- Matching theory
- Pólya's permanent problem
- Permanents, Pfaffian orientations, and even directed circuits
- Faster Scaling Algorithms for Network Problems
- Title not available (Why is that?)
- Signsolvability revisited
- Title not available (Why is that?)
- Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
- Symmetric sign pattern matrices that require unique inertia
- An identity for bipartite matching and symmetric determinant
Cited In (7)
- Sign patterns requiring a unique inertia
- Allow problems concerning spectral properties of sign pattern matrices: a survey
- Two classes of symmetric sign patterns that require unique inertia.
- Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem
- Computing the Inertia from Sign Patterns
- Computing of signs of eigenvalues for diagonally dominant matrix for inertia problem
- Title not available (Why is that?)
This page was built for publication: Computing the inertia from sign patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877192)