Connecting Terminals and 2-Disjoint Connected Subgraphs

@inproceedings{Telle2013ConnectingTA,
  title={Connecting Terminals and 2-Disjoint Connected Subgraphs},
  author={Jan Arne Telle and Yngve Villanger},
  booktitle={WG},
  year={2013}
}
Given a graph G = (V,E) and a set of terminal vertices T we say that a superset S of T is T -connecting if S induces a connected graph, and S is minimal if no strict subset of S is T -connecting. In this paper we prove that there are at most (|V \T | |T |−2 ) · 3 |V \T | 3 minimal T -connecting sets when |T | ≤ n/3 and that these can be enumerated within a polynomial factor of this bound. This generalizes the algorithm for enumerating all induced paths between a pair of vertices, corresponding… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Papadimitriou , and Mihalis Yannakakis . On generating all maximal independent sets

  • David S. Johnson, H Christos
  • Comput . Geom .
  • 2012

Woeginger . Partitioning graphs into connected parts

  • Vincent Vatter
  • Theor . Comput . Sci .
  • 2009

Similar Papers

Loading similar papers…