ISTA Publications
metadata only
Tight bounds on the performance of dynamic directed cutset data structures based on OMv
Efficient data structures for computing the cutset of a set of nodes in a graph undergoing dynamic edge insertions/deletions are well-studied in undirected graphs. We study this problem in directed graphs and show a reduction from the Online Boolean Matrix-Vector Multiplication Conjecture (OMv) intr
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
- Degree-based weighted adjacency matrices: spectra, integrality, and edge deletion effects#998133
- Bounds on Longest Simple Cycles in Weighted Directed Graphs via Optimum Cycle Means#1048544
- Canonization of a random graph by two matrix-vector multiplications#651997
- Canonization of a random graph by two matrix-vector multiplications#650544
- Strengthened upper bound on the third eigenvalue of graphs#1141400
Record · ID 988084
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