arXiv (All)
open access
A Row-wise Algorithm for Graph Realization
Given a $\{0, 1\}$-matrix $M$, the graph realization problem for $M$ asks if there exists a spanning forest such that the columns of $M$ are incidence vectors of paths in the forest. The problem is closely related to the recognition of network matrices, which are a large subclass of totally unimodul
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
- Mathematical foundations of the GraphBLAS#1366569
- Systematic construction of multiqubit unextendible product bases#1084710
- Singular difference graphs of vector spaces of square matrices#792441
- Singular difference graphs of vector spaces of square matrices#788441
- Decentralized Optimization over Time-Varying Row-Stochastic Digraphs#1142601
Record · ID 1187207
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