diff --git a/Cargo.toml b/Cargo.toml
index 0a6f4670..6bab175a 100644
--- a/Cargo.toml
+++ b/Cargo.toml
@@ -45,7 +45,7 @@ members = [
 resolver = "2"
 
 [workspace.package]
-version = "0.1.27"
+version = "0.1.28"
 edition = "2021"
 rust-version = "1.77"
 license = "MIT"
diff --git a/crates/ruvector-mincut/README.md b/crates/ruvector-mincut/README.md
index 32e5fe50..cbb08e72 100644
--- a/crates/ruvector-mincut/README.md
+++ b/crates/ruvector-mincut/README.md
@@ -917,7 +917,7 @@ This implementation is based on research in dynamic graph algorithms:
 
 **Built with ❤️ by [ruv.io](https://ruv.io)**
 
-**Status**: Production-ready • **Version**: 0.1.27 • **Rust Version**: 1.77+ • **Tests**: 448+ passing
+**Status**: Production-ready • **Version**: 0.1.28 • **Rust Version**: 1.77+ • **Tests**: 448+ passing
 
 *Keywords: rust, minimum-cut, dynamic-graph, graph-algorithm, connectivity, network-analysis, subpolynomial, real-time, wasm, simd*