Fixed-Parameter Algorithms for Cardinality-Constrained Graph Partitioning Problems on Sparse Graphs
S Yamada, T Hanaka - International Symposium on Combinatorial …, 2024 - Springer
For an undirected and edge-weighted graph G=(V, E) and a vertex subset S⊆ V, we define
a function φ G (S):=(1-α)· w (S)+ α· w (S, V\S), where α∈ 0, 1 is a real number, w (S) is the …
a function φ G (S):=(1-α)· w (S)+ α· w (S, V\S), where α∈ 0, 1 is a real number, w (S) is the …
Check for updates Fixed-Parameter Algorithms for Cardinality-Constrained Graph Partitioning Problems on Sparse Graphs
S Yamada - … Optimization: 8th International Symposium, ISCO 2024 … - books.google.com
For an undirected and edge-weighted graph G=(V, E) and a vertex subset S CV, we define a
function 4G (S):=(1− a)· w (S)+ aw (S, V\S), where a Є [0, 1] is a real number, w (S) is the …
function 4G (S):=(1− a)· w (S)+ aw (S, V\S), where a Є [0, 1] is a real number, w (S) is the …