Основні поняття
Proving NP-completeness and FPT algorithms for balanced subgraphs in bicolored graphs.
Статистика
An edge-colored graph is said to be balanced if it has an equal number of edges of each color.
Given a graph G with two colors, the Edge Balanced Connected Subgraph problem is NP-complete.
If a graph has a balanced connected subgraph/tree/path of size at least k, then it has one of size at least k and at most f(k) where f is a linear function.
Цитати
"An edge-colored graph is said to be balanced if it has an equal number of edges of each color."
"Edge Balanced Connected Subgraph problem is NP-complete."
"If a graph has a balanced connected subgraph/tree/path of size at least k, then it has one of size at least k and at most f(k) where f is a linear function."