Clustered Spanning Tree - Conditions for Feasibility
Let H =< V, S > be a hypergraph, where V is a set of vertices and S is a set of not necessarily disjoint clusters Si ⊆ V. The Clustered Spanning Tree problem is to find a spanning tree of G which satisfies that each cluster induces a subtree, when it exists. We provide an efficient and unique...
| Egile Nagusiak: | , , |
|---|---|
| Formatua: | Artikulua |
| Hizkuntza: | English |
| Argitaratua: |
Discrete Mathematics & Theoretical Computer Science
2019-08-01
|
| Saila: | Discrete Mathematics & Theoretical Computer Science |
| Gaiak: | |
| Sarrera elektronikoa: | https://dmtcs.episciences.org/4906/pdf |