Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

108

COCOON
2007
Springer

105views Combinatorics» more COCOON 2007»

Generating Minimal k-Vertex Connected Spanning Subgraphs

15 years 9 months ago

Generating Minimal k-Vertex Connected Spanning Subgraphs

Download www.mpi-inf.mpg.de

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

Real-time Traffic

COCOON 2007 | Incremental Polynomial Time | Polynomial |

claim paper

Related Content

» Generating 3vertex connected spanning subgraphs

» Computing Minimal Spanning Subgraphs in Linear Time

» Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems

» Enumerating Spanning and Connected Subsets in Graphs and Matroids

» Approximation algorithms and hardness results for labeled connectivity problems

» Power optimization for connectivity problems

» Online Structural Graph Clustering Using Frequent Subgraph Mining

» gSpan GraphBased Substructure Pattern Mining

» FLSS a faulttolerant topology control algorithm for wireless networks

Post Info
More Details (n/a)

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)