Generating Minimal k-Vertex Connected Spanning Subgraphs

14 years 5 months ago

Abstract. We show that minimal k-vertex connected spanning subgraphs of a given graph can be generated in incremental polynomial time for any ﬁxed k.

Endre Boros, Konrad Borys, Khaled M. Elbassioni, V

COCOON 2007 | Incremental Polynomial Time | Polynomial |

claim paper

Added	07 Jun 2010
Updated	07 Jun 2010
Type	Conference
Year	2007
Where	COCOON
Authors	Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Gábor Rudolf

Comments (0)