4865 search results - page 32 / 973 » The Complexity of Graph Connectivity |
SIAMCOMP
2010
13 years 8 months ago
2010
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
DM
2008
13 years 10 months ago
2008
We discuss the relationship between the vertical connectivity of a biased graph and the Tutte connectivity of the frame matroid of (also known as the bias matroid of ).
SODA
2012
ACM
12 years 15 days ago
2012
ACM
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
DM
2008
13 years 10 months ago
2008
In this paper we present an algorithm to generate all minimal 3-vertex connected spanning subgraphs of an undirected graph with n vertices and m edges in incremental polynomial tim...
ENDM
2006
13 years 10 months ago
2006
A graph is hypohamiltonian if it is not hamiltonian but every vertex-deleted subgraph is. In this paper we study hypohamiltonian snarks