Yaweni

Coalition_Games

Coalitional Security Games solver using MESA

direct_graph_source_target

Python function to redirect an undirected a graph so all paths leave from a source to a sink

MCDS-Honeypot-Allocation

min_edge_cut_multiple_st

Find the minimal cut for muliple source and targets. Functions by contracting edges

mincut_multiple_target

Multi-DPP

Spanning-Tree-Packing-Number

Short Python Code to find the maximal number of disjoint spanning trees on a graph, given a list of spanning trees, could equally be adapted to find the maximal number of disjoint sets in a list of sets

tracking

Yaweni/Multi-DPP

Yaweni/mincut_multiple_target

Yaweni/min_edge_cut_multiple_st

Find the minimal cut for muliple source and targets. Functions by contracting edges

Yaweni/direct_graph_source_target

Python function to redirect an undirected a graph so all paths leave from a source to a sink

Yaweni/Coalition_Games

Coalitional Security Games solver using MESA

Yaweni/tracking

Yaweni/Spanning-Tree-Packing-Number

Short Python Code to find the maximal number of disjoint spanning trees on a graph, given a list of spanning trees, could equally be adapted to find the maximal number of disjoint sets in a list of sets

Yaweni/MCDS-Honeypot-Allocation