This paper studies the controllability of multi-agent networks with antagonistic interactions, where signed graphs are used to represent such networks. By analyzing and abstracting definitions of ...

Finding the optimal Steiner Tree in graphs has been a critical combinatorial optimization challenge that finds widespread applications in network design. Despite its importance, finding the optimal ...