# Edge-based partitioning with vertex separators of oriented graphs

**URL:** <https://discourse.julialang.org/t/edge-based-partitioning-with-vertex-separators-of-oriented-graphs/88855>\
**Category:** Numerics\
**Created:** [October 17, 2022, 2:39pm UTC](https://discourse.julialang.org/t/edge-based-partitioning-with-vertex-separators-of-oriented-graphs/88855 "2022-10-17T14:39:44Z")\
**Posts on this page:** 2\
**Page:** 1

<div class="post-metadata">

**Author:** ![nvenkov1](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/nvenkov1/32/43679_2.png) [@nvenkov1](https://discourse.julialang.org/u/nvenkov1)\
**Post date:** [October 17, 2022, 2:39pm UTC](https://discourse.julialang.org/t/edge-based-partitioning-with-vertex-separators-of-oriented-graphs/88855/1 "2022-10-17T14:39:45Z")

</div>

I am searching for an algorithm that can create balanced edge-based partitions with vertex separators of oriented graphs. My understanding is that the METIS\_PartGraphKway function performs a vertex-based partition with edge separators. Instead, I am looking for a function that does edge-based partitions with vertex separators. Does anyone know of such an algorithm available in some Julia package?

---

<div class="post-metadata">

**Author:** ![nvenkov1](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/nvenkov1/32/43679_2.png) [@nvenkov1](https://discourse.julialang.org/u/nvenkov1)\
**Post date:** [October 17, 2022, 6:47pm UTC](https://discourse.julialang.org/t/edge-based-partitioning-with-vertex-separators-of-oriented-graphs/88855/2 "2022-10-17T18:47:11Z")

</div>

Perhaps it is possible to code something with Metis.separator, but is it necessary?