The Complexity of Graph Connectivity

13 years 9 months ago

Download www.math.ias.edu

In this paper we survey the major developments in understanding the complexity of the graph connectivity problem in several computational models, and highlight some challenging open problems.

Avi Wigderson

Real-time Traffic

Challenging Open Problems | Graph Connectivity Problem | Major Developments | MFCS 1992 | Theoretical Computer Science |

claim paper

» Connectivity of chamber graphs of buildings and related complexes

» Connectivity threshold and recovery time in rankbased models for complex networks

» Threshold graphs shifted complexes and graphical complexes

» Connected Coloring Completion for General Graphs Algorithms and Complexity

» The effect of girth on the kernelization complexity of Connected Dominating Set

» Kernelization and Complexity Results for Connectivity Augmentation Problems

» Connectivity graphs as models of local interactions

» 3connected Planar Graph Isomorphism is in Logspace

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1992
Where	MFCS
Authors	Avi Wigderson

Comments (0)

Sciweavers

The Complexity of Graph Connectivity

Challenging Open Problems | Graph Connectivity Problem | Major Developments | MFCS 1992 | Theoretical Computer Science |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers