Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: NP-hard

Sortuj według:

Ogranicz wyniki do:

On the Complexity of Reinforcement in Graphs

100%

Rad N. J.

Discussiones Mathematicae Graph Theory

2016

tom 36

nr 4

877-887

We show that the decision problem for p-reinforcement, p-total rein- forcement, total restrained reinforcement, and k-rainbow reinforcement are NP-hard for bipartite graphs.

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

Spanning trees with many or few colors in edge-colored graphs

84%

Broersma H., Li X.

Discussiones Mathematicae Graph Theory

1997

tom 17

nr 2

259-269

Given a graph G = (V,E) and a (not necessarily proper) edge-coloring of G, we consider the complexity of finding a spanning tree of G with as many different colors as possible, and of finding one with as few different colors as possible. We show that the first problem is equivalent to finding a common independent set of maximum cardinality in two matroids, implying that there is a polynomial algorithm. We use the minimum dominating set problem to show that the second problem is NP-hard.

Ograniczanie wyników

2 Discussiones Mathematicae Graph Theory

1 Broersma H.

1 Li X.

1 Rad N. J.

1 2016

1 1997

Wyniki wyszukiwania

On the Complexity of Reinforcement in Graphs

Spanning trees with many or few colors in edge-colored graphs