20 search results - page 2 / 4 » Enumerating Spanning and Connected Subsets in Graphs and Mat... |
DM
2008
13 years 4 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...
IPCO
2004
13 years 6 months ago
2004
We consider the problems of enumerating all minimal strongly connected subgraphs and all minimal dicuts of a given directed graph G = (V, E). We show that the first of these proble...
SODA
2004
ACM
13 years 6 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
ASPDAC
2001
ACM
13 years 8 months ago
2001
ACM
Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs o...
IWPEC
2009
Springer
13 years 11 months ago
2009
Springer
Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find a spanning tree with as many leaves as possible. When parameterized in the number of leav...