Add to ORKGWe show that enumerating all minimal spanning and connected subsets of a given matroid can be solved in incremental quasi-polynomial time. In the special case of graphical matroids, we improve this complexity bound by showing that all minimal $2$-vertex connected subgraphs of a given graph can be generated in incremental polynomial time
Let P be a property of undirected graphs. We consider the following problem: given a graph G that ha...
We prove that the extension complexity of the independence polytope of every regular matroid on n el...
This chapter examines the complexity of evaluating graph polynomials, related to the Tutte polynomia...
Abstract. We show that enumerating all minimal spanning and con-nected subsets of a given matroid ca...
We show that enumerating all minimal spanning and connected subsets of a given matroid can be solved...
We present an incremental polynomial-time algorithm for enumerating all circuits of a matroid or, mo...
Abstract. We present an incremental polynomial-time algorithm for enumerating all circuits of a matr...
We present an incremental polynomial-time algorithm for enumerating all circuits of a matroid or, mo...
AbstractIn this paper we present an algorithm to generate all minimal 3-vertex connected spanning su...
Listing, generating or enumerating objects of specified type is one of the principal tasks in algori...
We consider different ways of describing a matroid to a Turing machine by listing the members of var...
The node deletion problem on graphs is: given a graph and integer k, can we delete no more than k ve...
Given an undirected graphG=(V, E) and a partition {S, T} ofV, anS-Tconnectoris a set of edgesF¿Esuch...
International audienceIt is a long-standing open problem whether the minimal dominating sets of a gr...
For an arbitrary undirected simple graph G with m edges, we give an algorithm with running time O(m4...
Let P be a property of undirected graphs. We consider the following problem: given a graph G that ha...
We prove that the extension complexity of the independence polytope of every regular matroid on n el...
This chapter examines the complexity of evaluating graph polynomials, related to the Tutte polynomia...
Abstract. We show that enumerating all minimal spanning and con-nected subsets of a given matroid ca...
We show that enumerating all minimal spanning and connected subsets of a given matroid can be solved...
We present an incremental polynomial-time algorithm for enumerating all circuits of a matroid or, mo...
Abstract. We present an incremental polynomial-time algorithm for enumerating all circuits of a matr...
We present an incremental polynomial-time algorithm for enumerating all circuits of a matroid or, mo...
AbstractIn this paper we present an algorithm to generate all minimal 3-vertex connected spanning su...
Listing, generating or enumerating objects of specified type is one of the principal tasks in algori...
We consider different ways of describing a matroid to a Turing machine by listing the members of var...
The node deletion problem on graphs is: given a graph and integer k, can we delete no more than k ve...
Given an undirected graphG=(V, E) and a partition {S, T} ofV, anS-Tconnectoris a set of edgesF¿Esuch...
International audienceIt is a long-standing open problem whether the minimal dominating sets of a gr...
For an arbitrary undirected simple graph G with m edges, we give an algorithm with running time O(m4...
Let P be a property of undirected graphs. We consider the following problem: given a graph G that ha...
We prove that the extension complexity of the independence polytope of every regular matroid on n el...
This chapter examines the complexity of evaluating graph polynomials, related to the Tutte polynomia...