arXiv (OAI Expanded)
open access
Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming
Signed graphs are equipped with both positive and negative edge weights, encoding pairwise correlations as well as anti-correlations in data. A balanced signed graph is a signed graph with no cycles containing an odd number of negative edges. Laplacian of a balanced signed graph has eigenvectors tha
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming#819229
- A structure theory for signed graphs with fixed smallest eigenvalue#677502
- A structure theory for signed graphs with fixed smallest eigenvalue#674304
- The 11/6 supremum of the Wang-Sitters rounding scheme for graph balancing#998384
- Orthogonal signed graphs of degree 5#986378
Record · ID 809237
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive